./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:20:29,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:20:29,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:20:29,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:20:29,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:20:29,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:20:29,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:20:29,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:20:29,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:20:29,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:20:29,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:20:29,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:20:29,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:20:29,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:20:29,921 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:20:29,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:20:29,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:20:29,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:20:29,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:20:29,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:20:29,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:20:29,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:20:29,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:20:29,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:20:29,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:20:29,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:20:29,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:20:29,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:20:29,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:20:29,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:20:29,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:20:29,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:20:29,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:20:29,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:20:29,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:20:29,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:20:29,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:20:29,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:20:29,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:20:29,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:20:29,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:20:29,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:20:29,930 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 [2024-11-10 09:20:30,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:20:30,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:20:30,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:20:30,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:20:30,162 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:20:30,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2024-11-10 09:20:31,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:20:31,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:20:31,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2024-11-10 09:20:31,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca26f629/0643f14367264a57995ad0e318421b9d/FLAG645399911 [2024-11-10 09:20:31,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca26f629/0643f14367264a57995ad0e318421b9d [2024-11-10 09:20:31,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:20:31,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:20:31,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:20:31,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:20:31,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:20:31,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:31,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c93d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31, skipping insertion in model container [2024-11-10 09:20:31,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:31,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:20:31,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2024-11-10 09:20:31,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:20:31,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:20:31,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2024-11-10 09:20:31,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:20:31,978 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:20:31,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31 WrapperNode [2024-11-10 09:20:31,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:20:31,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:20:31,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:20:31,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:20:31,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:31,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,021 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2024-11-10 09:20:32,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:20:32,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:20:32,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:20:32,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:20:32,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,057 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2024-11-10 09:20:32,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:20:32,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:20:32,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:20:32,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:20:32,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (1/1) ... [2024-11-10 09:20:32,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:20:32,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:20:32,154 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) [2024-11-10 09:20:32,156 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 [2024-11-10 09:20:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:20:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:20:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:20:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:20:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:20:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:20:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:20:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:20:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:20:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:20:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-10 09:20:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:20:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-10 09:20:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:20:32,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:20:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:20:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 09:20:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:20:32,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:20:32,332 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:20:32,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:20:32,704 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2024-11-10 09:20:32,749 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-10 09:20:32,750 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:20:32,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:20:32,771 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:20:32,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:20:32 BoogieIcfgContainer [2024-11-10 09:20:32,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:20:32,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:20:32,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:20:32,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:20:32,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:20:31" (1/3) ... [2024-11-10 09:20:32,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731feab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:20:32, skipping insertion in model container [2024-11-10 09:20:32,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:20:31" (2/3) ... [2024-11-10 09:20:32,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731feab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:20:32, skipping insertion in model container [2024-11-10 09:20:32,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:20:32" (3/3) ... [2024-11-10 09:20:32,778 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2024-11-10 09:20:32,791 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:20:32,792 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:20:32,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:20:32,853 INFO L333 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, 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;@6921d493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:20:32,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:20:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 102 states have (on average 1.411764705882353) internal successors, (144), 103 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:20:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:20:32,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:32,866 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:32,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1831904280, now seen corresponding path program 1 times [2024-11-10 09:20:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915358620] [2024-11-10 09:20:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:33,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:33,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915358620] [2024-11-10 09:20:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915358620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:20:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879229982] [2024-11-10 09:20:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:33,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:20:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:20:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:20:33,332 INFO L87 Difference]: Start difference. First operand has 122 states, 102 states have (on average 1.411764705882353) internal successors, (144), 103 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:33,363 INFO L93 Difference]: Finished difference Result 236 states and 366 transitions. [2024-11-10 09:20:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:20:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-10 09:20:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:33,374 INFO L225 Difference]: With dead ends: 236 [2024-11-10 09:20:33,375 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 09:20:33,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:20:33,384 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:33,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 09:20:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-10 09:20:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:20:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-10 09:20:33,424 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 145 [2024-11-10 09:20:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:33,425 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-10 09:20:33,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-10 09:20:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:20:33,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:33,427 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:33,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:20:33,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:33,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1506497327, now seen corresponding path program 1 times [2024-11-10 09:20:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427503211] [2024-11-10 09:20:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427503211] [2024-11-10 09:20:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427503211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:20:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585724621] [2024-11-10 09:20:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:20:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:20:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:33,808 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:33,855 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-10 09:20:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:20:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:20:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:33,858 INFO L225 Difference]: With dead ends: 234 [2024-11-10 09:20:33,860 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 09:20:33,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:33,861 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:33,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 09:20:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-10 09:20:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:20:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-10 09:20:33,878 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 145 [2024-11-10 09:20:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:33,882 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-10 09:20:33,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-10 09:20:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:20:33,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:33,884 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:33,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:20:33,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1309983822, now seen corresponding path program 1 times [2024-11-10 09:20:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:33,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696628813] [2024-11-10 09:20:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696628813] [2024-11-10 09:20:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696628813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:34,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:34,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:20:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946175596] [2024-11-10 09:20:34,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:34,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:20:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:20:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:34,081 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:34,114 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-10 09:20:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:20:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:20:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:34,116 INFO L225 Difference]: With dead ends: 238 [2024-11-10 09:20:34,116 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 09:20:34,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:34,117 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:34,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 09:20:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-10 09:20:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:20:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-10 09:20:34,124 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 145 [2024-11-10 09:20:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:34,125 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-10 09:20:34,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-10 09:20:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:20:34,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:34,127 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:34,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:20:34,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:34,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1242173139, now seen corresponding path program 1 times [2024-11-10 09:20:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652527891] [2024-11-10 09:20:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:34,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:34,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652527891] [2024-11-10 09:20:34,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652527891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:34,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:20:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379343000] [2024-11-10 09:20:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:34,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:20:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:20:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:34,308 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:34,341 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2024-11-10 09:20:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:20:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:20:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:34,344 INFO L225 Difference]: With dead ends: 242 [2024-11-10 09:20:34,344 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 09:20:34,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:34,345 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:34,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 09:20:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-10 09:20:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:20:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-10 09:20:34,362 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 145 [2024-11-10 09:20:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:34,363 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-10 09:20:34,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-10 09:20:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:20:34,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:34,364 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:34,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:20:34,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1213543988, now seen corresponding path program 1 times [2024-11-10 09:20:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366570221] [2024-11-10 09:20:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:34,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:34,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366570221] [2024-11-10 09:20:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366570221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:34,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:34,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:20:34,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112414331] [2024-11-10 09:20:34,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:34,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:20:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:20:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:34,870 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:34,985 INFO L93 Difference]: Finished difference Result 271 states and 387 transitions. [2024-11-10 09:20:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:20:34,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:20:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:34,987 INFO L225 Difference]: With dead ends: 271 [2024-11-10 09:20:34,988 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 09:20:34,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:34,989 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 110 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:34,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 574 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 09:20:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-10 09:20:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 124 states have internal predecessors, (164), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:20:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 212 transitions. [2024-11-10 09:20:35,003 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 212 transitions. Word has length 145 [2024-11-10 09:20:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:35,003 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 212 transitions. [2024-11-10 09:20:35,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 212 transitions. [2024-11-10 09:20:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 09:20:35,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:35,006 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:35,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:20:35,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:35,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2116386130, now seen corresponding path program 1 times [2024-11-10 09:20:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863232077] [2024-11-10 09:20:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:35,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863232077] [2024-11-10 09:20:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863232077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:20:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604691931] [2024-11-10 09:20:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:35,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:20:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:20:35,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:35,199 INFO L87 Difference]: Start difference. First operand 150 states and 212 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:35,230 INFO L93 Difference]: Finished difference Result 279 states and 394 transitions. [2024-11-10 09:20:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:20:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-10 09:20:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:35,234 INFO L225 Difference]: With dead ends: 279 [2024-11-10 09:20:35,234 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 09:20:35,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:35,236 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:35,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 09:20:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-10 09:20:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 126 states have (on average 1.3253968253968254) internal successors, (167), 127 states have internal predecessors, (167), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:20:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 215 transitions. [2024-11-10 09:20:35,253 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 215 transitions. Word has length 147 [2024-11-10 09:20:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:35,254 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 215 transitions. [2024-11-10 09:20:35,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 215 transitions. [2024-11-10 09:20:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 09:20:35,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:35,256 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:35,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:20:35,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:35,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1290687490, now seen corresponding path program 1 times [2024-11-10 09:20:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139462771] [2024-11-10 09:20:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139462771] [2024-11-10 09:20:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139462771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:20:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339078961] [2024-11-10 09:20:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:20:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:20:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:35,420 INFO L87 Difference]: Start difference. First operand 153 states and 215 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:35,442 INFO L93 Difference]: Finished difference Result 283 states and 398 transitions. [2024-11-10 09:20:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:20:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-10 09:20:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:35,445 INFO L225 Difference]: With dead ends: 283 [2024-11-10 09:20:35,445 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 09:20:35,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:35,446 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:35,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 09:20:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-10 09:20:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 128 states have internal predecessors, (168), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:20:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2024-11-10 09:20:35,455 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 148 [2024-11-10 09:20:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:35,455 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2024-11-10 09:20:35,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2024-11-10 09:20:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 09:20:35,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:35,457 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:20:35,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:35,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:35,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2135159361, now seen corresponding path program 1 times [2024-11-10 09:20:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764336160] [2024-11-10 09:20:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:35,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764336160] [2024-11-10 09:20:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764336160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017868881] [2024-11-10 09:20:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:35,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:35,941 INFO L87 Difference]: Start difference. First operand 154 states and 216 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:36,070 INFO L93 Difference]: Finished difference Result 285 states and 399 transitions. [2024-11-10 09:20:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-10 09:20:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:36,072 INFO L225 Difference]: With dead ends: 285 [2024-11-10 09:20:36,072 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 09:20:36,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:20:36,073 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 105 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:36,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 735 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 09:20:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-10 09:20:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.32) internal successors, (165), 126 states have internal predecessors, (165), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:20:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 213 transitions. [2024-11-10 09:20:36,079 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 213 transitions. Word has length 148 [2024-11-10 09:20:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:36,079 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 213 transitions. [2024-11-10 09:20:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 213 transitions. [2024-11-10 09:20:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 09:20:36,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:36,081 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:36,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:20:36,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:36,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash -836422672, now seen corresponding path program 1 times [2024-11-10 09:20:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:36,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724512591] [2024-11-10 09:20:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724512591] [2024-11-10 09:20:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724512591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:36,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:20:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751186179] [2024-11-10 09:20:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:20:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:20:36,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:36,589 INFO L87 Difference]: Start difference. First operand 152 states and 213 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:36,746 INFO L93 Difference]: Finished difference Result 323 states and 454 transitions. [2024-11-10 09:20:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:20:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2024-11-10 09:20:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:36,748 INFO L225 Difference]: With dead ends: 323 [2024-11-10 09:20:36,748 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 09:20:36,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:36,749 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 87 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:36,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 453 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 09:20:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2024-11-10 09:20:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 09:20:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 250 transitions. [2024-11-10 09:20:36,764 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 250 transitions. Word has length 149 [2024-11-10 09:20:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:36,766 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 250 transitions. [2024-11-10 09:20:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 250 transitions. [2024-11-10 09:20:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 09:20:36,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:36,768 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:20:36,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1499851695, now seen corresponding path program 1 times [2024-11-10 09:20:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612630485] [2024-11-10 09:20:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:36,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612630485] [2024-11-10 09:20:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612630485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:36,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:36,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:20:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472928141] [2024-11-10 09:20:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:36,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:20:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:20:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:36,889 INFO L87 Difference]: Start difference. First operand 180 states and 250 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:36,923 INFO L93 Difference]: Finished difference Result 382 states and 533 transitions. [2024-11-10 09:20:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:20:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-10 09:20:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:36,926 INFO L225 Difference]: With dead ends: 382 [2024-11-10 09:20:36,926 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 09:20:36,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:36,927 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 87 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:36,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 317 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 09:20:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 202. [2024-11-10 09:20:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 164 states have (on average 1.3170731707317074) internal successors, (216), 164 states have internal predecessors, (216), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 09:20:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 284 transitions. [2024-11-10 09:20:36,942 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 284 transitions. Word has length 151 [2024-11-10 09:20:36,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:36,942 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 284 transitions. [2024-11-10 09:20:36,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 284 transitions. [2024-11-10 09:20:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:20:36,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:36,943 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:36,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:20:36,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:36,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1737745565, now seen corresponding path program 1 times [2024-11-10 09:20:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973568843] [2024-11-10 09:20:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973568843] [2024-11-10 09:20:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973568843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:37,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:20:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487149558] [2024-11-10 09:20:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:20:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:20:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:37,038 INFO L87 Difference]: Start difference. First operand 202 states and 284 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:37,063 INFO L93 Difference]: Finished difference Result 427 states and 602 transitions. [2024-11-10 09:20:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:20:37,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:20:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:37,065 INFO L225 Difference]: With dead ends: 427 [2024-11-10 09:20:37,065 INFO L226 Difference]: Without dead ends: 277 [2024-11-10 09:20:37,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:37,066 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 84 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:37,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-10 09:20:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 225. [2024-11-10 09:20:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 187 states have (on average 1.3422459893048129) internal successors, (251), 187 states have internal predecessors, (251), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 09:20:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 319 transitions. [2024-11-10 09:20:37,078 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 319 transitions. Word has length 152 [2024-11-10 09:20:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:37,078 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 319 transitions. [2024-11-10 09:20:37,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 319 transitions. [2024-11-10 09:20:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 09:20:37,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:37,080 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:20:37,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:37,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash -930454346, now seen corresponding path program 1 times [2024-11-10 09:20:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486790775] [2024-11-10 09:20:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486790775] [2024-11-10 09:20:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486790775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:37,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:37,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304585595] [2024-11-10 09:20:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:37,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:37,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:37,578 INFO L87 Difference]: Start difference. First operand 225 states and 319 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:37,670 INFO L93 Difference]: Finished difference Result 515 states and 728 transitions. [2024-11-10 09:20:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-10 09:20:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:37,673 INFO L225 Difference]: With dead ends: 515 [2024-11-10 09:20:37,673 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 09:20:37,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:37,674 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 78 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:37,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 820 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 09:20:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2024-11-10 09:20:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 296 states have (on average 1.364864864864865) internal successors, (404), 297 states have internal predecessors, (404), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:20:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 476 transitions. [2024-11-10 09:20:37,691 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 476 transitions. Word has length 153 [2024-11-10 09:20:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:37,691 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 476 transitions. [2024-11-10 09:20:37,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 476 transitions. [2024-11-10 09:20:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 09:20:37,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:37,693 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:37,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:20:37,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:37,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash -600688585, now seen corresponding path program 1 times [2024-11-10 09:20:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253960948] [2024-11-10 09:20:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253960948] [2024-11-10 09:20:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253960948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:38,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389998197] [2024-11-10 09:20:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:38,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:38,064 INFO L87 Difference]: Start difference. First operand 338 states and 476 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:38,233 INFO L93 Difference]: Finished difference Result 644 states and 914 transitions. [2024-11-10 09:20:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:20:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2024-11-10 09:20:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:38,236 INFO L225 Difference]: With dead ends: 644 [2024-11-10 09:20:38,236 INFO L226 Difference]: Without dead ends: 362 [2024-11-10 09:20:38,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:20:38,237 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 86 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:38,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 711 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-10 09:20:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2024-11-10 09:20:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 299 states have (on average 1.3612040133779264) internal successors, (407), 300 states have internal predecessors, (407), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:20:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 479 transitions. [2024-11-10 09:20:38,252 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 479 transitions. Word has length 153 [2024-11-10 09:20:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:38,252 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 479 transitions. [2024-11-10 09:20:38,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 479 transitions. [2024-11-10 09:20:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 09:20:38,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:38,254 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:38,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:20:38,255 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash 673177027, now seen corresponding path program 1 times [2024-11-10 09:20:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:38,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761511281] [2024-11-10 09:20:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761511281] [2024-11-10 09:20:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761511281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:20:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143555531] [2024-11-10 09:20:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:20:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:20:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:20:39,073 INFO L87 Difference]: Start difference. First operand 341 states and 479 transitions. Second operand has 8 states, 6 states have (on average 12.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-10 09:20:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:39,259 INFO L93 Difference]: Finished difference Result 791 states and 1102 transitions. [2024-11-10 09:20:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:20:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2024-11-10 09:20:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:39,261 INFO L225 Difference]: With dead ends: 791 [2024-11-10 09:20:39,261 INFO L226 Difference]: Without dead ends: 509 [2024-11-10 09:20:39,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:20:39,262 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 103 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:39,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1280 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-10 09:20:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 505. [2024-11-10 09:20:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 445 states have (on average 1.3325842696629213) internal successors, (593), 448 states have internal predecessors, (593), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:20:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 695 transitions. [2024-11-10 09:20:39,280 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 695 transitions. Word has length 154 [2024-11-10 09:20:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:39,281 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 695 transitions. [2024-11-10 09:20:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-10 09:20:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 695 transitions. [2024-11-10 09:20:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:20:39,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:39,282 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:20:39,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash 467734425, now seen corresponding path program 1 times [2024-11-10 09:20:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729204354] [2024-11-10 09:20:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729204354] [2024-11-10 09:20:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729204354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:39,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368966808] [2024-11-10 09:20:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:39,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:39,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:39,734 INFO L87 Difference]: Start difference. First operand 505 states and 695 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:39,824 INFO L93 Difference]: Finished difference Result 1136 states and 1563 transitions. [2024-11-10 09:20:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:39,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2024-11-10 09:20:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:39,827 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 09:20:39,827 INFO L226 Difference]: Without dead ends: 690 [2024-11-10 09:20:39,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:39,829 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 190 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:39,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 858 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-10 09:20:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 598. [2024-11-10 09:20:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 538 states have (on average 1.3475836431226766) internal successors, (725), 541 states have internal predecessors, (725), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:20:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 827 transitions. [2024-11-10 09:20:39,848 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 827 transitions. Word has length 155 [2024-11-10 09:20:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:39,849 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 827 transitions. [2024-11-10 09:20:39,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 827 transitions. [2024-11-10 09:20:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:20:39,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:39,850 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:39,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:20:39,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:39,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -709851003, now seen corresponding path program 1 times [2024-11-10 09:20:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109292508] [2024-11-10 09:20:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:39,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109292508] [2024-11-10 09:20:39,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109292508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:39,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:39,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:20:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706089303] [2024-11-10 09:20:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:39,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:20:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:20:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:39,936 INFO L87 Difference]: Start difference. First operand 598 states and 827 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:39,964 INFO L93 Difference]: Finished difference Result 1146 states and 1595 transitions. [2024-11-10 09:20:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:20:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-10 09:20:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:39,967 INFO L225 Difference]: With dead ends: 1146 [2024-11-10 09:20:39,967 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 09:20:39,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:39,968 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:39,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 09:20:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-11-10 09:20:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 547 states have (on average 1.3418647166361974) internal successors, (734), 550 states have internal predecessors, (734), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:20:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 836 transitions. [2024-11-10 09:20:39,992 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 836 transitions. Word has length 156 [2024-11-10 09:20:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:39,992 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 836 transitions. [2024-11-10 09:20:39,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 836 transitions. [2024-11-10 09:20:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:20:39,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:39,994 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:20:39,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:39,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1759760673, now seen corresponding path program 1 times [2024-11-10 09:20:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355580893] [2024-11-10 09:20:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:40,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355580893] [2024-11-10 09:20:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355580893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:40,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:20:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432737379] [2024-11-10 09:20:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:40,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:20:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:20:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:40,092 INFO L87 Difference]: Start difference. First operand 607 states and 836 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:40,118 INFO L93 Difference]: Finished difference Result 1159 states and 1603 transitions. [2024-11-10 09:20:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:20:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-10 09:20:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:40,123 INFO L225 Difference]: With dead ends: 1159 [2024-11-10 09:20:40,123 INFO L226 Difference]: Without dead ends: 611 [2024-11-10 09:20:40,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:20:40,124 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:40,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:20:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-10 09:20:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2024-11-10 09:20:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 551 states have (on average 1.339382940108893) internal successors, (738), 554 states have internal predecessors, (738), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:20:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 840 transitions. [2024-11-10 09:20:40,145 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 840 transitions. Word has length 156 [2024-11-10 09:20:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:40,146 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 840 transitions. [2024-11-10 09:20:40,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 840 transitions. [2024-11-10 09:20:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:20:40,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:40,147 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:40,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:20:40,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:40,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:40,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1037414988, now seen corresponding path program 1 times [2024-11-10 09:20:40,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:40,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506789638] [2024-11-10 09:20:40,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:40,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:40,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506789638] [2024-11-10 09:20:40,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506789638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:40,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:40,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:20:40,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546260028] [2024-11-10 09:20:40,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:20:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:40,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:20:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:40,825 INFO L87 Difference]: Start difference. First operand 611 states and 840 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:40,967 INFO L93 Difference]: Finished difference Result 634 states and 864 transitions. [2024-11-10 09:20:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:20:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-10 09:20:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:40,971 INFO L225 Difference]: With dead ends: 634 [2024-11-10 09:20:40,971 INFO L226 Difference]: Without dead ends: 631 [2024-11-10 09:20:40,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:20:40,972 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 89 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:40,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1063 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-10 09:20:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2024-11-10 09:20:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 569 states have (on average 1.328646748681898) internal successors, (756), 572 states have internal predecessors, (756), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 09:20:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 858 transitions. [2024-11-10 09:20:41,001 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 858 transitions. Word has length 156 [2024-11-10 09:20:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:41,002 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 858 transitions. [2024-11-10 09:20:41,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 858 transitions. [2024-11-10 09:20:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:20:41,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:41,003 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:20:41,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:41,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1066044139, now seen corresponding path program 1 times [2024-11-10 09:20:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584194141] [2024-11-10 09:20:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-10 09:20:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584194141] [2024-11-10 09:20:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584194141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:20:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225534264] [2024-11-10 09:20:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:20:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:20:41,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:20:41,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:20:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:42,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 09:20:42,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:20:42,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-10 09:20:42,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-10 09:20:42,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:20:42,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:20:42,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-10 09:20:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-10 09:20:42,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:20:42,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-10 09:20:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-10 09:20:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225534264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:20:42,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:20:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 20 [2024-11-10 09:20:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809365351] [2024-11-10 09:20:42,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:20:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 09:20:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:42,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 09:20:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-10 09:20:42,991 INFO L87 Difference]: Start difference. First operand 631 states and 858 transitions. Second operand has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 9 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 6 states have call predecessors, (51), 9 states have call successors, (51) [2024-11-10 09:20:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:43,862 INFO L93 Difference]: Finished difference Result 1737 states and 2343 transitions. [2024-11-10 09:20:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 09:20:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 9 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 6 states have call predecessors, (51), 9 states have call successors, (51) Word has length 156 [2024-11-10 09:20:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:43,867 INFO L225 Difference]: With dead ends: 1737 [2024-11-10 09:20:43,867 INFO L226 Difference]: Without dead ends: 1165 [2024-11-10 09:20:43,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2024-11-10 09:20:43,869 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 215 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:43,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1371 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:20:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-11-10 09:20:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1090. [2024-11-10 09:20:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 986 states have (on average 1.3184584178498986) internal successors, (1300), 992 states have internal predecessors, (1300), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-10 09:20:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1466 transitions. [2024-11-10 09:20:43,922 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1466 transitions. Word has length 156 [2024-11-10 09:20:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1466 transitions. [2024-11-10 09:20:43,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 9 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 6 states have call predecessors, (51), 9 states have call successors, (51) [2024-11-10 09:20:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1466 transitions. [2024-11-10 09:20:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 09:20:43,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:43,924 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:43,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:20:44,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:20:44,126 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:44,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1798523140, now seen corresponding path program 1 times [2024-11-10 09:20:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:44,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089492096] [2024-11-10 09:20:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089492096] [2024-11-10 09:20:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089492096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:20:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304229958] [2024-11-10 09:20:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:20:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:20:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:44,625 INFO L87 Difference]: Start difference. First operand 1090 states and 1466 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:44,794 INFO L93 Difference]: Finished difference Result 2134 states and 2879 transitions. [2024-11-10 09:20:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:20:44,795 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 157 [2024-11-10 09:20:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:44,800 INFO L225 Difference]: With dead ends: 2134 [2024-11-10 09:20:44,800 INFO L226 Difference]: Without dead ends: 1562 [2024-11-10 09:20:44,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:44,803 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 95 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:44,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 535 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-10 09:20:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1557. [2024-11-10 09:20:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1434 states have (on average 1.3221757322175731) internal successors, (1896), 1444 states have internal predecessors, (1896), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:20:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2090 transitions. [2024-11-10 09:20:44,865 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2090 transitions. Word has length 157 [2024-11-10 09:20:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:44,867 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2090 transitions. [2024-11-10 09:20:44,867 INFO L472 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2090 transitions. [2024-11-10 09:20:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 09:20:44,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:44,869 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:44,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:20:44,869 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:44,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1499371803, now seen corresponding path program 1 times [2024-11-10 09:20:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370193634] [2024-11-10 09:20:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370193634] [2024-11-10 09:20:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370193634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:45,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:45,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463676188] [2024-11-10 09:20:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:45,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:45,217 INFO L87 Difference]: Start difference. First operand 1557 states and 2090 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:45,372 INFO L93 Difference]: Finished difference Result 2793 states and 3744 transitions. [2024-11-10 09:20:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2024-11-10 09:20:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:45,378 INFO L225 Difference]: With dead ends: 2793 [2024-11-10 09:20:45,379 INFO L226 Difference]: Without dead ends: 1758 [2024-11-10 09:20:45,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:45,381 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 84 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:45,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 960 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-11-10 09:20:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1561. [2024-11-10 09:20:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1438 states have (on average 1.321279554937413) internal successors, (1900), 1448 states have internal predecessors, (1900), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:20:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2094 transitions. [2024-11-10 09:20:45,446 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2094 transitions. Word has length 157 [2024-11-10 09:20:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:45,446 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2094 transitions. [2024-11-10 09:20:45,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2094 transitions. [2024-11-10 09:20:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 09:20:45,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:45,448 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:20:45,448 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1550831012, now seen corresponding path program 1 times [2024-11-10 09:20:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768896566] [2024-11-10 09:20:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:45,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768896566] [2024-11-10 09:20:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768896566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:45,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:20:45,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898521617] [2024-11-10 09:20:45,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:45,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:20:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:20:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:20:45,744 INFO L87 Difference]: Start difference. First operand 1561 states and 2094 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:45,935 INFO L93 Difference]: Finished difference Result 3528 states and 4724 transitions. [2024-11-10 09:20:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 157 [2024-11-10 09:20:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:45,942 INFO L225 Difference]: With dead ends: 3528 [2024-11-10 09:20:45,942 INFO L226 Difference]: Without dead ends: 2034 [2024-11-10 09:20:45,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:20:45,944 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 151 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:45,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1088 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2024-11-10 09:20:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1694. [2024-11-10 09:20:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1571 states have (on average 1.3163590070019096) internal successors, (2068), 1581 states have internal predecessors, (2068), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:20:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2262 transitions. [2024-11-10 09:20:46,005 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2262 transitions. Word has length 157 [2024-11-10 09:20:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:46,005 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2262 transitions. [2024-11-10 09:20:46,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2262 transitions. [2024-11-10 09:20:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:20:46,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:46,007 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:46,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:20:46,007 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 734994408, now seen corresponding path program 1 times [2024-11-10 09:20:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43155072] [2024-11-10 09:20:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43155072] [2024-11-10 09:20:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43155072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682518435] [2024-11-10 09:20:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:46,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:46,350 INFO L87 Difference]: Start difference. First operand 1694 states and 2262 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:46,471 INFO L93 Difference]: Finished difference Result 2752 states and 3677 transitions. [2024-11-10 09:20:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:46,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2024-11-10 09:20:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:46,478 INFO L225 Difference]: With dead ends: 2752 [2024-11-10 09:20:46,478 INFO L226 Difference]: Without dead ends: 1662 [2024-11-10 09:20:46,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:46,482 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 89 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:46,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 754 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-10 09:20:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1560. [2024-11-10 09:20:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1437 states have (on average 1.3089770354906054) internal successors, (1881), 1447 states have internal predecessors, (1881), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:20:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2075 transitions. [2024-11-10 09:20:46,547 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2075 transitions. Word has length 158 [2024-11-10 09:20:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:46,547 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2075 transitions. [2024-11-10 09:20:46,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2075 transitions. [2024-11-10 09:20:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:20:46,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:46,549 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:46,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:20:46,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 696313417, now seen corresponding path program 1 times [2024-11-10 09:20:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509455930] [2024-11-10 09:20:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:47,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:47,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509455930] [2024-11-10 09:20:47,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509455930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:47,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:47,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:20:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797065457] [2024-11-10 09:20:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:47,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:20:47,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:47,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:20:47,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:20:47,238 INFO L87 Difference]: Start difference. First operand 1560 states and 2075 transitions. Second operand has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:47,755 INFO L93 Difference]: Finished difference Result 3425 states and 4553 transitions. [2024-11-10 09:20:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:20:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2024-11-10 09:20:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:47,762 INFO L225 Difference]: With dead ends: 3425 [2024-11-10 09:20:47,762 INFO L226 Difference]: Without dead ends: 2014 [2024-11-10 09:20:47,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:20:47,765 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 253 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:47,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 780 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:20:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-10 09:20:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1775. [2024-11-10 09:20:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1651 states have (on average 1.3137492428831012) internal successors, (2169), 1661 states have internal predecessors, (2169), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:20:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2363 transitions. [2024-11-10 09:20:47,841 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2363 transitions. Word has length 158 [2024-11-10 09:20:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:47,841 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2363 transitions. [2024-11-10 09:20:47,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2363 transitions. [2024-11-10 09:20:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:20:47,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:47,843 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:47,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:20:47,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1648353624, now seen corresponding path program 1 times [2024-11-10 09:20:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:47,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109566512] [2024-11-10 09:20:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:47,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:48,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:48,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109566512] [2024-11-10 09:20:48,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109566512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:48,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:20:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443883719] [2024-11-10 09:20:48,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:48,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:20:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:20:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:48,085 INFO L87 Difference]: Start difference. First operand 1775 states and 2363 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:48,253 INFO L93 Difference]: Finished difference Result 3116 states and 4162 transitions. [2024-11-10 09:20:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:20:48,254 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2024-11-10 09:20:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:48,258 INFO L225 Difference]: With dead ends: 3116 [2024-11-10 09:20:48,258 INFO L226 Difference]: Without dead ends: 1494 [2024-11-10 09:20:48,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:20:48,261 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:48,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 373 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-10 09:20:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1461. [2024-11-10 09:20:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1353 states have (on average 1.3074648928307464) internal successors, (1769), 1361 states have internal predecessors, (1769), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:20:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1937 transitions. [2024-11-10 09:20:48,310 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1937 transitions. Word has length 158 [2024-11-10 09:20:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1937 transitions. [2024-11-10 09:20:48,311 INFO L472 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1937 transitions. [2024-11-10 09:20:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:48,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:48,312 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:20:48,312 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:48,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -933611018, now seen corresponding path program 1 times [2024-11-10 09:20:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668443517] [2024-11-10 09:20:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668443517] [2024-11-10 09:20:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668443517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:20:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056728085] [2024-11-10 09:20:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:48,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:20:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:20:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:48,639 INFO L87 Difference]: Start difference. First operand 1461 states and 1937 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:48,754 INFO L93 Difference]: Finished difference Result 2515 states and 3345 transitions. [2024-11-10 09:20:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:20:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 160 [2024-11-10 09:20:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:48,760 INFO L225 Difference]: With dead ends: 2515 [2024-11-10 09:20:48,760 INFO L226 Difference]: Without dead ends: 1559 [2024-11-10 09:20:48,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:20:48,762 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 81 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:48,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 937 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-11-10 09:20:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1457. [2024-11-10 09:20:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1349 states have (on average 1.3054114158636028) internal successors, (1761), 1357 states have internal predecessors, (1761), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:20:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1929 transitions. [2024-11-10 09:20:48,808 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1929 transitions. Word has length 160 [2024-11-10 09:20:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:48,808 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1929 transitions. [2024-11-10 09:20:48,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:20:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1929 transitions. [2024-11-10 09:20:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:48,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:48,810 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:48,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:20:48,810 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2111368746, now seen corresponding path program 1 times [2024-11-10 09:20:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699336199] [2024-11-10 09:20:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-10 09:20:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699336199] [2024-11-10 09:20:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699336199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:20:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992368050] [2024-11-10 09:20:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:20:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:20:50,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:20:50,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:20:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:50,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 09:20:50,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:20:50,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:20:50,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:20:51,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-11-10 09:20:51,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:20:51,260 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 70 treesize of output 32 [2024-11-10 09:20:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:51,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:20:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992368050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:51,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:20:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 25 [2024-11-10 09:20:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623495585] [2024-11-10 09:20:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:51,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:20:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:20:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:20:51,327 INFO L87 Difference]: Start difference. First operand 1457 states and 1929 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:51,691 INFO L93 Difference]: Finished difference Result 2414 states and 3212 transitions. [2024-11-10 09:20:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:20:51,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-10 09:20:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:51,696 INFO L225 Difference]: With dead ends: 2414 [2024-11-10 09:20:51,696 INFO L226 Difference]: Without dead ends: 1462 [2024-11-10 09:20:51,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2024-11-10 09:20:51,699 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 89 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:51,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1537 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:20:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-11-10 09:20:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1445. [2024-11-10 09:20:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1337 states have (on average 1.3051608077786088) internal successors, (1745), 1345 states have internal predecessors, (1745), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:20:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1913 transitions. [2024-11-10 09:20:51,750 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1913 transitions. Word has length 160 [2024-11-10 09:20:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1913 transitions. [2024-11-10 09:20:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1913 transitions. [2024-11-10 09:20:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:51,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:51,752 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:51,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 09:20:51,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 09:20:51,957 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:51,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1547866904, now seen corresponding path program 1 times [2024-11-10 09:20:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573774564] [2024-11-10 09:20:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-10 09:20:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573774564] [2024-11-10 09:20:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573774564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:20:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989817158] [2024-11-10 09:20:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:53,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:20:53,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:20:53,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:20:53,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 09:20:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:54,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 09:20:54,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:20:54,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:20:54,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 47 [2024-11-10 09:20:54,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:20:54,301 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 80 treesize of output 32 [2024-11-10 09:20:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-10 09:20:54,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:20:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989817158] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:20:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:20:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23, 11] total 30 [2024-11-10 09:20:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973025039] [2024-11-10 09:20:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:20:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:20:54,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2024-11-10 09:20:54,666 INFO L87 Difference]: Start difference. First operand 1445 states and 1913 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:55,065 INFO L93 Difference]: Finished difference Result 2722 states and 3616 transitions. [2024-11-10 09:20:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:20:55,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-10 09:20:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:55,085 INFO L225 Difference]: With dead ends: 2722 [2024-11-10 09:20:55,086 INFO L226 Difference]: Without dead ends: 1782 [2024-11-10 09:20:55,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 349 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 09:20:55,089 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 102 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:55,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1611 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:20:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2024-11-10 09:20:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1525. [2024-11-10 09:20:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1417 states have (on average 1.311926605504587) internal successors, (1859), 1425 states have internal predecessors, (1859), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:20:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2027 transitions. [2024-11-10 09:20:55,144 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2027 transitions. Word has length 160 [2024-11-10 09:20:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:55,144 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2027 transitions. [2024-11-10 09:20:55,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2027 transitions. [2024-11-10 09:20:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:55,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:55,146 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:55,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:20:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:20:55,347 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 550794551, now seen corresponding path program 1 times [2024-11-10 09:20:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:55,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445030642] [2024-11-10 09:20:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:55,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445030642] [2024-11-10 09:20:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445030642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:55,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:55,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:20:55,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285746430] [2024-11-10 09:20:55,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:55,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:20:55,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:55,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:20:55,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:55,721 INFO L87 Difference]: Start difference. First operand 1525 states and 2027 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:55,888 INFO L93 Difference]: Finished difference Result 2754 states and 3670 transitions. [2024-11-10 09:20:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:20:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-10 09:20:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:55,896 INFO L225 Difference]: With dead ends: 2754 [2024-11-10 09:20:55,896 INFO L226 Difference]: Without dead ends: 1734 [2024-11-10 09:20:55,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:55,901 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 89 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:55,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 815 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-11-10 09:20:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1513. [2024-11-10 09:20:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1405 states have (on average 1.3103202846975088) internal successors, (1841), 1413 states have internal predecessors, (1841), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:20:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2009 transitions. [2024-11-10 09:20:55,955 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2009 transitions. Word has length 160 [2024-11-10 09:20:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:55,955 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2009 transitions. [2024-11-10 09:20:55,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2009 transitions. [2024-11-10 09:20:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:55,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:55,957 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:55,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 09:20:55,957 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 271909569, now seen corresponding path program 1 times [2024-11-10 09:20:55,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:55,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044771829] [2024-11-10 09:20:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044771829] [2024-11-10 09:20:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044771829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:56,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:56,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:20:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701538556] [2024-11-10 09:20:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:56,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:20:56,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:20:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:20:56,320 INFO L87 Difference]: Start difference. First operand 1513 states and 2009 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:56,755 INFO L93 Difference]: Finished difference Result 3493 states and 4638 transitions. [2024-11-10 09:20:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:20:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-10 09:20:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:56,767 INFO L225 Difference]: With dead ends: 3493 [2024-11-10 09:20:56,769 INFO L226 Difference]: Without dead ends: 2133 [2024-11-10 09:20:56,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:20:56,773 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 494 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:56,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 883 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:20:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2024-11-10 09:20:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1951. [2024-11-10 09:20:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1810 states have (on average 1.2939226519337017) internal successors, (2342), 1822 states have internal predecessors, (2342), 110 states have call successors, (110), 30 states have call predecessors, (110), 30 states have return successors, (110), 98 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:20:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2562 transitions. [2024-11-10 09:20:56,844 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2562 transitions. Word has length 160 [2024-11-10 09:20:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:56,845 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 2562 transitions. [2024-11-10 09:20:56,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2562 transitions. [2024-11-10 09:20:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:56,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:56,846 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:56,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 09:20:56,846 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:56,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1533956031, now seen corresponding path program 1 times [2024-11-10 09:20:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002234060] [2024-11-10 09:20:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:20:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:20:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:20:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:20:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:20:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:20:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:20:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:20:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:20:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:20:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:20:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:20:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:20:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:20:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:20:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:20:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:20:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:20:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:20:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:20:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002234060] [2024-11-10 09:20:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002234060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:20:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:20:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:20:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731616003] [2024-11-10 09:20:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:20:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:20:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:20:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:20:57,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:20:57,020 INFO L87 Difference]: Start difference. First operand 1951 states and 2562 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:20:57,187 INFO L93 Difference]: Finished difference Result 3861 states and 5087 transitions. [2024-11-10 09:20:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:20:57,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-10 09:20:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:20:57,199 INFO L225 Difference]: With dead ends: 3861 [2024-11-10 09:20:57,200 INFO L226 Difference]: Without dead ends: 2081 [2024-11-10 09:20:57,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:20:57,202 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 119 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:20:57,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 692 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:20:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2024-11-10 09:20:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1915. [2024-11-10 09:20:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1774 states have (on average 1.2880496054114994) internal successors, (2285), 1786 states have internal predecessors, (2285), 110 states have call successors, (110), 30 states have call predecessors, (110), 30 states have return successors, (110), 98 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 09:20:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2505 transitions. [2024-11-10 09:20:57,298 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2505 transitions. Word has length 160 [2024-11-10 09:20:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:20:57,298 INFO L471 AbstractCegarLoop]: Abstraction has 1915 states and 2505 transitions. [2024-11-10 09:20:57,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:20:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2505 transitions. [2024-11-10 09:20:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:20:57,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:20:57,299 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:57,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 09:20:57,300 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:20:57,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:20:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash -92767993, now seen corresponding path program 1 times [2024-11-10 09:20:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:20:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462307391] [2024-11-10 09:20:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:20:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:20:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:20:57,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:20:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:20:57,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:20:57,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:20:57,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:20:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 09:20:57,468 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:20:57,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:20:57,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:20:57 BoogieIcfgContainer [2024-11-10 09:20:57,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:20:57,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:20:57,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:20:57,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:20:57,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:20:32" (3/4) ... [2024-11-10 09:20:57,566 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:20:57,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:20:57,568 INFO L158 Benchmark]: Toolchain (without parser) took 25930.83ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 878.7MB). Free memory was 92.8MB in the beginning and 878.8MB in the end (delta: -786.0MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-11-10 09:20:57,568 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 115.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:20:57,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.20ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 75.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:20:57,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.54ms. Allocated memory is still 161.5MB. Free memory was 75.4MB in the beginning and 71.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:20:57,568 INFO L158 Benchmark]: Boogie Preprocessor took 73.70ms. Allocated memory is still 161.5MB. Free memory was 71.4MB in the beginning and 66.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:20:57,568 INFO L158 Benchmark]: IcfgBuilder took 675.41ms. Allocated memory is still 161.5MB. Free memory was 66.5MB in the beginning and 93.6MB in the end (delta: -27.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 09:20:57,569 INFO L158 Benchmark]: TraceAbstraction took 24790.20ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 878.7MB). Free memory was 92.8MB in the beginning and 878.8MB in the end (delta: -786.0MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2024-11-10 09:20:57,569 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 1.0GB. Free memory is still 878.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:20:57,569 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.14ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 115.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.20ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 75.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.54ms. Allocated memory is still 161.5MB. Free memory was 75.4MB in the beginning and 71.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.70ms. Allocated memory is still 161.5MB. Free memory was 71.4MB in the beginning and 66.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 675.41ms. Allocated memory is still 161.5MB. Free memory was 66.5MB in the beginning and 93.6MB in the end (delta: -27.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24790.20ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 878.7MB). Free memory was 92.8MB in the beginning and 878.8MB in the end (delta: -786.0MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 1.0GB. Free memory is still 878.8MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of bitwiseOr at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L43] signed short int last_1_signed_short_int_Array_0_0_ = -16; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 0; [L45] unsigned long int last_1_unsigned_long_int_Array_0_0__1_ = 25; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L103] EXPR signed_short_int_Array_0[0] [L103] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L104] EXPR unsigned_char_Array_0[0] [L104] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L105] EXPR unsigned_long_int_Array_0[0][1] [L105] last_1_unsigned_long_int_Array_0_0__1_ = unsigned_long_int_Array_0[0][1] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L86] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L89] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L92] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L98] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L116] RET updateVariables() [L117] CALL step() [L49] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] COND FALSE !(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) [L56] EXPR signed_char_Array_0[0][1] [L56] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L58] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L58] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L61] EXPR unsigned_long_int_Array_0[0][0] [L61] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L61] COND TRUE unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0] [L62] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L62] EXPR signed_char_Array_0[1][0] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] signed_long_int_Array_0[0] = ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))) [L64] signed_short_int_Array_0[0] = 2 [L65] EXPR float_Array_0[1] [L65] float_Array_0[0] = float_Array_0[1] [L66] EXPR unsigned_char_Array_0[1] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L67] EXPR signed_char_Array_0[1][0] [L67] EXPR signed_char_Array_0[1][1] [L67] unsigned char stepLocal_0 = signed_char_Array_0[1][0] < signed_char_Array_0[1][1]; [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] COND FALSE !(stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) [L71] EXPR unsigned_long_int_Array_0[1][1] [L71] EXPR unsigned_long_int_Array_0[1][0] [L71] unsigned_long_int_Array_0[0][1] = (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L108] EXPR BOOL_unsigned_char_Array_0[1] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR signed_char_Array_0[0][1] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) [L108] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) [L108] EXPR unsigned_long_int_Array_0[0][1] [L108] EXPR unsigned_long_int_Array_0[1][1] [L108] EXPR unsigned_long_int_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) [L108] EXPR unsigned_long_int_Array_0[0][0] [L108] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 [L108] EXPR signed_long_int_Array_0[0] [L108] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) [L108] EXPR signed_short_int_Array_0[0] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L108] EXPR float_Array_0[0] [L108] EXPR float_Array_0[1] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108-L109] return (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 32, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3014 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2992 mSDsluCounter, 22710 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17003 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4870 IncrementalHoareTripleChecker+Invalid, 5262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 5707 mSDtfsCounter, 4870 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2151 GetRequests, 1939 SyntacticMatches, 5 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1951occurred in iteration=30, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 2183 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 5400 NumberOfCodeBlocks, 5400 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5520 ConstructedInterpolants, 0 QuantifiedInterpolants, 25712 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 19404/19584 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:20:57,595 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:20:59,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:20:59,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:20:59,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:20:59,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:20:59,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:20:59,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:20:59,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:20:59,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:20:59,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:20:59,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:20:59,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:20:59,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:20:59,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:20:59,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:20:59,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:20:59,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:20:59,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:20:59,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:20:59,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:20:59,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:20:59,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:20:59,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:20:59,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:20:59,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:20:59,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:20:59,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:20:59,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:20:59,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:20:59,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:20:59,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:20:59,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:20:59,542 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:20:59,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:20:59,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:20:59,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:20:59,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:20:59,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:20:59,543 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 [2024-11-10 09:20:59,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:20:59,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:20:59,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:20:59,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:20:59,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:20:59,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2024-11-10 09:21:01,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:01,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:01,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2024-11-10 09:21:01,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e4dcc28/c10772ba71d14ecbb493a21478c11770/FLAG965e64536 [2024-11-10 09:21:01,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e4dcc28/c10772ba71d14ecbb493a21478c11770 [2024-11-10 09:21:01,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:01,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:01,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:01,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:01,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:01,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa536df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01, skipping insertion in model container [2024-11-10 09:21:01,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:01,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2024-11-10 09:21:01,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:01,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:01,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2024-11-10 09:21:01,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:01,746 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:01,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01 WrapperNode [2024-11-10 09:21:01,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:01,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:01,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:01,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:01,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,812 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-11-10 09:21:01,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:01,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:01,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:01,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:01,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,854 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2024-11-10 09:21:01,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:01,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:01,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:01,889 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:01,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (1/1) ... [2024-11-10 09:21:01,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:01,919 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) [2024-11-10 09:21:01,921 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 [2024-11-10 09:21:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:21:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:21:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:21:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:21:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:21:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-10 09:21:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-10 09:21:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:21:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:21:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:21:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-10 09:21:02,107 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:02,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:02,493 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite90#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~short82#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~ite119#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite113#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2024-11-10 09:21:02,539 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:02,539 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:02,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:02,554 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:02,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:02 BoogieIcfgContainer [2024-11-10 09:21:02,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:02,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:02,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:02,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:02,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:01" (1/3) ... [2024-11-10 09:21:02,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecc5b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:02, skipping insertion in model container [2024-11-10 09:21:02,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:01" (2/3) ... [2024-11-10 09:21:02,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecc5b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:02, skipping insertion in model container [2024-11-10 09:21:02,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:02" (3/3) ... [2024-11-10 09:21:02,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2024-11-10 09:21:02,574 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:02,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:02,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:02,642 INFO L333 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, 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;@62ddbf66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:02,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:21:02,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:02,661 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:02,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:02,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash -977771756, now seen corresponding path program 1 times [2024-11-10 09:21:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611114030] [2024-11-10 09:21:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:02,680 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 [2024-11-10 09:21:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:02,683 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) [2024-11-10 09:21:02,684 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 [2024-11-10 09:21:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:02,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:21:02,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-10 09:21:02,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:02,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611114030] [2024-11-10 09:21:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611114030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754898570] [2024-11-10 09:21:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:02,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:02,993 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:03,021 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2024-11-10 09:21:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-11-10 09:21:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:03,028 INFO L225 Difference]: With dead ends: 220 [2024-11-10 09:21:03,028 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 09:21:03,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:03,032 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:03,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 09:21:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-10 09:21:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-11-10 09:21:03,075 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 141 [2024-11-10 09:21:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:03,075 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-11-10 09:21:03,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-11-10 09:21:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:21:03,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:03,077 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:03,083 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 [2024-11-10 09:21:03,278 WARN L453 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 [2024-11-10 09:21:03,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:03,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 339490219, now seen corresponding path program 1 times [2024-11-10 09:21:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302095709] [2024-11-10 09:21:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:03,281 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 [2024-11-10 09:21:03,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:03,284 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) [2024-11-10 09:21:03,302 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 [2024-11-10 09:21:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:03,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 09:21:03,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:03,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:03,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302095709] [2024-11-10 09:21:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302095709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:03,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:03,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195607011] [2024-11-10 09:21:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:03,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:03,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:03,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:03,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:03,584 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:03,694 INFO L93 Difference]: Finished difference Result 222 states and 323 transitions. [2024-11-10 09:21:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-10 09:21:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:03,704 INFO L225 Difference]: With dead ends: 222 [2024-11-10 09:21:03,704 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:21:03,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:03,707 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:03,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 734 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:21:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-10 09:21:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-10 09:21:03,719 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 141 [2024-11-10 09:21:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:03,724 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-10 09:21:03,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-10 09:21:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:21:03,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:03,726 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:03,732 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 [2024-11-10 09:21:03,926 WARN L453 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 [2024-11-10 09:21:03,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:03,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash 142976714, now seen corresponding path program 1 times [2024-11-10 09:21:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:03,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560558768] [2024-11-10 09:21:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:03,928 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 [2024-11-10 09:21:03,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:03,931 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) [2024-11-10 09:21:03,932 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 [2024-11-10 09:21:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 09:21:04,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:04,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:04,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560558768] [2024-11-10 09:21:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560558768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113937608] [2024-11-10 09:21:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:04,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:04,156 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:04,211 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2024-11-10 09:21:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-10 09:21:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:04,213 INFO L225 Difference]: With dead ends: 230 [2024-11-10 09:21:04,213 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 09:21:04,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:04,214 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:04,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 09:21:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-10 09:21:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-10 09:21:04,235 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 141 [2024-11-10 09:21:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-10 09:21:04,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-10 09:21:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:21:04,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:04,238 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:04,243 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 [2024-11-10 09:21:04,438 WARN L453 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 [2024-11-10 09:21:04,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:04,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1885787049, now seen corresponding path program 1 times [2024-11-10 09:21:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933156033] [2024-11-10 09:21:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:04,440 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 [2024-11-10 09:21:04,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:04,444 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) [2024-11-10 09:21:04,445 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 [2024-11-10 09:21:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:04,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 09:21:04,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:04,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:04,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933156033] [2024-11-10 09:21:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933156033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:04,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:04,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:21:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253913600] [2024-11-10 09:21:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:04,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:21:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:21:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:04,648 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:04,707 INFO L93 Difference]: Finished difference Result 234 states and 333 transitions. [2024-11-10 09:21:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:21:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-10 09:21:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:04,709 INFO L225 Difference]: With dead ends: 234 [2024-11-10 09:21:04,709 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 09:21:04,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:04,710 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:04,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1006 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 09:21:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-10 09:21:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2024-11-10 09:21:04,720 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 141 [2024-11-10 09:21:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:04,721 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2024-11-10 09:21:04,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2024-11-10 09:21:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:21:04,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:04,722 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:04,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 09:21:04,926 WARN L453 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 [2024-11-10 09:21:04,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1914416200, now seen corresponding path program 1 times [2024-11-10 09:21:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:04,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009735742] [2024-11-10 09:21:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:04,928 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 [2024-11-10 09:21:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:04,930 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) [2024-11-10 09:21:04,931 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 [2024-11-10 09:21:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:05,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 09:21:05,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:05,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-10 09:21:05,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-10 09:21:05,466 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 [2024-11-10 09:21:05,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:05,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:05,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:05,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-10 09:21:05,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:05,925 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 31 treesize of output 13 [2024-11-10 09:21:05,928 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 [2024-11-10 09:21:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 379 proven. 12 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-10 09:21:05,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-10 09:21:06,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009735742] [2024-11-10 09:21:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009735742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:21:06,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:21:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-11-10 09:21:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528321404] [2024-11-10 09:21:06,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:21:06,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:21:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:06,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:21:06,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:21:06,262 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-10 09:21:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:07,574 INFO L93 Difference]: Finished difference Result 359 states and 505 transitions. [2024-11-10 09:21:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:21:07,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 141 [2024-11-10 09:21:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:07,577 INFO L225 Difference]: With dead ends: 359 [2024-11-10 09:21:07,577 INFO L226 Difference]: Without dead ends: 243 [2024-11-10 09:21:07,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:21:07,578 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 612 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:07,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1110 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 09:21:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-10 09:21:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2024-11-10 09:21:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 196 states have (on average 1.336734693877551) internal successors, (262), 196 states have internal predecessors, (262), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 09:21:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 330 transitions. [2024-11-10 09:21:07,594 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 330 transitions. Word has length 141 [2024-11-10 09:21:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:07,594 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 330 transitions. [2024-11-10 09:21:07,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-10 09:21:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 330 transitions. [2024-11-10 09:21:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:21:07,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:07,596 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:07,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 09:21:07,796 WARN L453 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 [2024-11-10 09:21:07,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1736204298, now seen corresponding path program 1 times [2024-11-10 09:21:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652588784] [2024-11-10 09:21:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:07,797 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 [2024-11-10 09:21:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:07,800 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) [2024-11-10 09:21:07,800 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 [2024-11-10 09:21:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:07,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:21:07,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:08,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:08,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652588784] [2024-11-10 09:21:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652588784] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-10 09:21:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329170658] [2024-11-10 09:21:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:08,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:08,263 INFO L87 Difference]: Start difference. First operand 234 states and 330 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:08,333 INFO L93 Difference]: Finished difference Result 497 states and 696 transitions. [2024-11-10 09:21:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:08,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-10 09:21:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:08,336 INFO L225 Difference]: With dead ends: 497 [2024-11-10 09:21:08,337 INFO L226 Difference]: Without dead ends: 381 [2024-11-10 09:21:08,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:08,338 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 174 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:08,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 432 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-10 09:21:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 376. [2024-11-10 09:21:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 332 states have (on average 1.3524096385542168) internal successors, (449), 334 states have internal predecessors, (449), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 09:21:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 525 transitions. [2024-11-10 09:21:08,365 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 525 transitions. Word has length 143 [2024-11-10 09:21:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:08,365 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 525 transitions. [2024-11-10 09:21:08,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 525 transitions. [2024-11-10 09:21:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:21:08,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:08,367 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:08,374 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 [2024-11-10 09:21:08,567 WARN L453 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 [2024-11-10 09:21:08,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:08,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash -547889910, now seen corresponding path program 1 times [2024-11-10 09:21:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842867078] [2024-11-10 09:21:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:08,569 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 [2024-11-10 09:21:08,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:08,570 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) [2024-11-10 09:21:08,571 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 [2024-11-10 09:21:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:08,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:21:08,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:08,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-10 09:21:08,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:08,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:21:09,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:09,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2024-11-10 09:21:09,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:09,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 46 [2024-11-10 09:21:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-10 09:21:09,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:09,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842867078] [2024-11-10 09:21:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842867078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:21:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196959520] [2024-11-10 09:21:09,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:09,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:21:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:21:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:09,461 INFO L87 Difference]: Start difference. First operand 376 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:10,273 INFO L93 Difference]: Finished difference Result 927 states and 1286 transitions. [2024-11-10 09:21:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:21:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-10 09:21:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:10,277 INFO L225 Difference]: With dead ends: 927 [2024-11-10 09:21:10,277 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 09:21:10,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:21:10,278 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 314 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:10,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 842 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:21:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 09:21:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 411. [2024-11-10 09:21:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 358 states have (on average 1.335195530726257) internal successors, (478), 361 states have internal predecessors, (478), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-10 09:21:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 568 transitions. [2024-11-10 09:21:10,299 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 568 transitions. Word has length 143 [2024-11-10 09:21:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:10,299 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 568 transitions. [2024-11-10 09:21:10,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 568 transitions. [2024-11-10 09:21:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:21:10,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:10,301 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:10,309 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 (8)] Ended with exit code 0 [2024-11-10 09:21:10,502 WARN L453 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 [2024-11-10 09:21:10,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:10,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2087004235, now seen corresponding path program 1 times [2024-11-10 09:21:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:10,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322438593] [2024-11-10 09:21:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:10,503 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 [2024-11-10 09:21:10,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:10,504 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) [2024-11-10 09:21:10,505 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 [2024-11-10 09:21:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:10,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:10,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:10,670 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 [2024-11-10 09:21:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:10,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:10,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322438593] [2024-11-10 09:21:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322438593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:10,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:10,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495071888] [2024-11-10 09:21:10,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:10,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:10,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:10,798 INFO L87 Difference]: Start difference. First operand 411 states and 568 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:10,932 INFO L93 Difference]: Finished difference Result 1023 states and 1414 transitions. [2024-11-10 09:21:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-10 09:21:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:10,937 INFO L225 Difference]: With dead ends: 1023 [2024-11-10 09:21:10,938 INFO L226 Difference]: Without dead ends: 640 [2024-11-10 09:21:10,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:10,939 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 148 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:10,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 606 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-10 09:21:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 442. [2024-11-10 09:21:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 377 states have (on average 1.3183023872679045) internal successors, (497), 379 states have internal predecessors, (497), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 607 transitions. [2024-11-10 09:21:10,972 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 607 transitions. Word has length 143 [2024-11-10 09:21:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 607 transitions. [2024-11-10 09:21:10,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 607 transitions. [2024-11-10 09:21:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:21:10,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:10,974 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:10,985 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 (9)] Ended with exit code 0 [2024-11-10 09:21:11,175 WARN L453 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 [2024-11-10 09:21:11,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1115963698, now seen corresponding path program 1 times [2024-11-10 09:21:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947474668] [2024-11-10 09:21:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:11,176 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 [2024-11-10 09:21:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:11,179 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) [2024-11-10 09:21:11,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 09:21:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:11,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:21:11,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:11,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:11,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947474668] [2024-11-10 09:21:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947474668] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-10 09:21:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421836959] [2024-11-10 09:21:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:11,629 INFO L87 Difference]: Start difference. First operand 442 states and 607 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:11,709 INFO L93 Difference]: Finished difference Result 856 states and 1183 transitions. [2024-11-10 09:21:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:11,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:21:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:11,712 INFO L225 Difference]: With dead ends: 856 [2024-11-10 09:21:11,712 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 09:21:11,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:11,713 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 26 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:11,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 469 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 09:21:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 442. [2024-11-10 09:21:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 377 states have (on average 1.312997347480106) internal successors, (495), 379 states have internal predecessors, (495), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 605 transitions. [2024-11-10 09:21:11,744 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 605 transitions. Word has length 145 [2024-11-10 09:21:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:11,744 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 605 transitions. [2024-11-10 09:21:11,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 605 transitions. [2024-11-10 09:21:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:21:11,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:11,746 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:11,758 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 (10)] Ended with exit code 0 [2024-11-10 09:21:11,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:11,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:11,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1466763635, now seen corresponding path program 1 times [2024-11-10 09:21:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494752998] [2024-11-10 09:21:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:11,947 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 [2024-11-10 09:21:11,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:11,948 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:11,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 09:21:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:21:12,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:12,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:12,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494752998] [2024-11-10 09:21:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494752998] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:12,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-10 09:21:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419283168] [2024-11-10 09:21:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:12,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:12,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:12,462 INFO L87 Difference]: Start difference. First operand 442 states and 605 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:12,555 INFO L93 Difference]: Finished difference Result 977 states and 1341 transitions. [2024-11-10 09:21:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:21:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:12,558 INFO L225 Difference]: With dead ends: 977 [2024-11-10 09:21:12,558 INFO L226 Difference]: Without dead ends: 594 [2024-11-10 09:21:12,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:21:12,559 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 83 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:12,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 693 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-10 09:21:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 477. [2024-11-10 09:21:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 412 states have (on average 1.325242718446602) internal successors, (546), 414 states have internal predecessors, (546), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 656 transitions. [2024-11-10 09:21:12,578 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 656 transitions. Word has length 145 [2024-11-10 09:21:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:12,578 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 656 transitions. [2024-11-10 09:21:12,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 656 transitions. [2024-11-10 09:21:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:21:12,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:12,579 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:12,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 09:21:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:12,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1983731790, now seen corresponding path program 1 times [2024-11-10 09:21:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:12,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568779195] [2024-11-10 09:21:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:12,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:12,783 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) [2024-11-10 09:21:12,784 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 [2024-11-10 09:21:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:12,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:12,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:12,945 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 [2024-11-10 09:21:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:13,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:13,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:13,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568779195] [2024-11-10 09:21:13,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568779195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455855717] [2024-11-10 09:21:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:13,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:13,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:13,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:13,066 INFO L87 Difference]: Start difference. First operand 477 states and 656 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:13,180 INFO L93 Difference]: Finished difference Result 1045 states and 1443 transitions. [2024-11-10 09:21:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:13,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:21:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:13,183 INFO L225 Difference]: With dead ends: 1045 [2024-11-10 09:21:13,183 INFO L226 Difference]: Without dead ends: 627 [2024-11-10 09:21:13,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:13,184 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 131 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:13,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 599 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-10 09:21:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 527. [2024-11-10 09:21:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 462 states have (on average 1.3333333333333333) internal successors, (616), 464 states have internal predecessors, (616), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 726 transitions. [2024-11-10 09:21:13,203 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 726 transitions. Word has length 145 [2024-11-10 09:21:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 726 transitions. [2024-11-10 09:21:13,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 726 transitions. [2024-11-10 09:21:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:21:13,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:13,205 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:13,211 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 [2024-11-10 09:21:13,405 WARN L453 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 [2024-11-10 09:21:13,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:13,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1859827984, now seen corresponding path program 1 times [2024-11-10 09:21:13,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:13,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232929779] [2024-11-10 09:21:13,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:13,406 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 [2024-11-10 09:21:13,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:13,407 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) [2024-11-10 09:21:13,408 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 [2024-11-10 09:21:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:13,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:13,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:13,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:13,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:13,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232929779] [2024-11-10 09:21:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232929779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631369497] [2024-11-10 09:21:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:13,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:13,582 INFO L87 Difference]: Start difference. First operand 527 states and 726 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:13,617 INFO L93 Difference]: Finished difference Result 957 states and 1322 transitions. [2024-11-10 09:21:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-10 09:21:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:13,619 INFO L225 Difference]: With dead ends: 957 [2024-11-10 09:21:13,619 INFO L226 Difference]: Without dead ends: 539 [2024-11-10 09:21:13,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:13,621 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:13,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-10 09:21:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-10 09:21:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 474 states have (on average 1.3248945147679325) internal successors, (628), 476 states have internal predecessors, (628), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 738 transitions. [2024-11-10 09:21:13,639 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 738 transitions. Word has length 145 [2024-11-10 09:21:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:13,639 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 738 transitions. [2024-11-10 09:21:13,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 738 transitions. [2024-11-10 09:21:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 09:21:13,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:13,640 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:13,646 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 [2024-11-10 09:21:13,840 WARN L453 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 [2024-11-10 09:21:13,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -654055424, now seen corresponding path program 1 times [2024-11-10 09:21:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646780853] [2024-11-10 09:21:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:13,842 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 [2024-11-10 09:21:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:13,844 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) [2024-11-10 09:21:13,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 09:21:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:21:14,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:14,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:14,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:14,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646780853] [2024-11-10 09:21:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646780853] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:14,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:14,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-10 09:21:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994941215] [2024-11-10 09:21:14,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:14,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:14,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:14,301 INFO L87 Difference]: Start difference. First operand 539 states and 738 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:14,372 INFO L93 Difference]: Finished difference Result 1084 states and 1479 transitions. [2024-11-10 09:21:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:14,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-10 09:21:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:14,375 INFO L225 Difference]: With dead ends: 1084 [2024-11-10 09:21:14,375 INFO L226 Difference]: Without dead ends: 654 [2024-11-10 09:21:14,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:14,376 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 73 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:14,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 583 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-10 09:21:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 541. [2024-11-10 09:21:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 476 states have (on average 1.319327731092437) internal successors, (628), 478 states have internal predecessors, (628), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 738 transitions. [2024-11-10 09:21:14,394 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 738 transitions. Word has length 146 [2024-11-10 09:21:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:14,394 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 738 transitions. [2024-11-10 09:21:14,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 738 transitions. [2024-11-10 09:21:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 09:21:14,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:14,395 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:14,402 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 [2024-11-10 09:21:14,596 WARN L453 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 [2024-11-10 09:21:14,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1719302190, now seen corresponding path program 1 times [2024-11-10 09:21:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:14,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631725724] [2024-11-10 09:21:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:14,597 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 [2024-11-10 09:21:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:14,599 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) [2024-11-10 09:21:14,600 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 [2024-11-10 09:21:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:14,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:21:14,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:14,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:15,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631725724] [2024-11-10 09:21:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631725724] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:15,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:15,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-10 09:21:15,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204743410] [2024-11-10 09:21:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:15,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:15,077 INFO L87 Difference]: Start difference. First operand 541 states and 738 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:15,139 INFO L93 Difference]: Finished difference Result 1074 states and 1457 transitions. [2024-11-10 09:21:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-10 09:21:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:15,142 INFO L225 Difference]: With dead ends: 1074 [2024-11-10 09:21:15,142 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 09:21:15,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:15,145 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 128 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:15,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 472 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 09:21:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 549. [2024-11-10 09:21:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 486 states have internal predecessors, (637), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 747 transitions. [2024-11-10 09:21:15,166 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 747 transitions. Word has length 147 [2024-11-10 09:21:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:15,167 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 747 transitions. [2024-11-10 09:21:15,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 747 transitions. [2024-11-10 09:21:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 09:21:15,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:15,168 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:15,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:15,368 WARN L453 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 [2024-11-10 09:21:15,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1300347805, now seen corresponding path program 1 times [2024-11-10 09:21:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506678304] [2024-11-10 09:21:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:15,370 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 [2024-11-10 09:21:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:15,373 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) [2024-11-10 09:21:15,374 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 [2024-11-10 09:21:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:15,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:21:15,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:15,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:15,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506678304] [2024-11-10 09:21:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506678304] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-10 09:21:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082974680] [2024-11-10 09:21:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:15,885 INFO L87 Difference]: Start difference. First operand 549 states and 747 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:15,957 INFO L93 Difference]: Finished difference Result 1082 states and 1464 transitions. [2024-11-10 09:21:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-10 09:21:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:15,959 INFO L225 Difference]: With dead ends: 1082 [2024-11-10 09:21:15,960 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 09:21:15,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:21:15,961 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 80 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:15,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 678 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 09:21:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 549. [2024-11-10 09:21:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 484 states have (on average 1.31198347107438) internal successors, (635), 486 states have internal predecessors, (635), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 745 transitions. [2024-11-10 09:21:15,986 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 745 transitions. Word has length 148 [2024-11-10 09:21:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:15,987 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 745 transitions. [2024-11-10 09:21:15,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 745 transitions. [2024-11-10 09:21:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 09:21:15,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:15,988 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:15,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 09:21:16,189 WARN L453 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 [2024-11-10 09:21:16,190 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:16,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1709172030, now seen corresponding path program 1 times [2024-11-10 09:21:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:16,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577682024] [2024-11-10 09:21:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:16,191 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 [2024-11-10 09:21:16,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:16,192 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) [2024-11-10 09:21:16,193 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 [2024-11-10 09:21:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:16,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 09:21:16,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:16,421 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 [2024-11-10 09:21:16,426 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 [2024-11-10 09:21:16,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:16,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:16,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-10 09:21:16,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:16,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2024-11-10 09:21:16,584 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 [2024-11-10 09:21:16,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:16,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 42 [2024-11-10 09:21:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-10 09:21:16,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:17,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577682024] [2024-11-10 09:21:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577682024] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2024-11-10 09:21:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315086260] [2024-11-10 09:21:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:17,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:21:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:17,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:21:17,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:21:17,091 INFO L87 Difference]: Start difference. First operand 549 states and 745 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:17,470 INFO L93 Difference]: Finished difference Result 989 states and 1342 transitions. [2024-11-10 09:21:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-10 09:21:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:17,475 INFO L225 Difference]: With dead ends: 989 [2024-11-10 09:21:17,475 INFO L226 Difference]: Without dead ends: 549 [2024-11-10 09:21:17,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:21:17,479 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 217 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:17,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 780 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:21:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-10 09:21:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 545. [2024-11-10 09:21:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 478 states have (on average 1.3054393305439331) internal successors, (624), 480 states have internal predecessors, (624), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 09:21:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 734 transitions. [2024-11-10 09:21:17,501 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 734 transitions. Word has length 148 [2024-11-10 09:21:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:17,502 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 734 transitions. [2024-11-10 09:21:17,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 734 transitions. [2024-11-10 09:21:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 09:21:17,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:17,504 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:17,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-10 09:21:17,704 WARN L453 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 [2024-11-10 09:21:17,704 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:17,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1211251019, now seen corresponding path program 1 times [2024-11-10 09:21:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:17,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289482759] [2024-11-10 09:21:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:17,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:17,706 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) [2024-11-10 09:21:17,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 09:21:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:17,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 09:21:17,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:17,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:21:17,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:17,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-10 09:21:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:17,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:17,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:17,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289482759] [2024-11-10 09:21:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289482759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534129575] [2024-11-10 09:21:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:17,998 INFO L87 Difference]: Start difference. First operand 545 states and 734 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:18,193 INFO L93 Difference]: Finished difference Result 1314 states and 1758 transitions. [2024-11-10 09:21:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-10 09:21:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:18,197 INFO L225 Difference]: With dead ends: 1314 [2024-11-10 09:21:18,197 INFO L226 Difference]: Without dead ends: 882 [2024-11-10 09:21:18,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:18,198 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 101 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:18,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 913 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-10 09:21:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 869. [2024-11-10 09:21:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 768 states have (on average 1.2890625) internal successors, (990), 774 states have internal predecessors, (990), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-10 09:21:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1156 transitions. [2024-11-10 09:21:18,230 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1156 transitions. Word has length 148 [2024-11-10 09:21:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:18,230 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1156 transitions. [2024-11-10 09:21:18,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1156 transitions. [2024-11-10 09:21:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 09:21:18,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:18,231 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:18,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 09:21:18,431 WARN L453 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 [2024-11-10 09:21:18,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:18,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash -842175831, now seen corresponding path program 1 times [2024-11-10 09:21:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615388186] [2024-11-10 09:21:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:18,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:18,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:18,434 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) [2024-11-10 09:21:18,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 09:21:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:18,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 09:21:18,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:18,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:18,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615388186] [2024-11-10 09:21:18,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615388186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:18,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:18,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:21:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924499886] [2024-11-10 09:21:18,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:18,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:21:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:21:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:18,634 INFO L87 Difference]: Start difference. First operand 869 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:18,682 INFO L93 Difference]: Finished difference Result 1627 states and 2173 transitions. [2024-11-10 09:21:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:21:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-10 09:21:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:18,686 INFO L225 Difference]: With dead ends: 1627 [2024-11-10 09:21:18,686 INFO L226 Difference]: Without dead ends: 877 [2024-11-10 09:21:18,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:18,687 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:18,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-10 09:21:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2024-11-10 09:21:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 776 states have (on average 1.2860824742268042) internal successors, (998), 782 states have internal predecessors, (998), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-10 09:21:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1164 transitions. [2024-11-10 09:21:18,717 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1164 transitions. Word has length 150 [2024-11-10 09:21:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:18,717 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1164 transitions. [2024-11-10 09:21:18,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1164 transitions. [2024-11-10 09:21:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 09:21:18,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:18,718 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:18,724 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 [2024-11-10 09:21:18,919 WARN L453 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 [2024-11-10 09:21:18,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1564521516, now seen corresponding path program 1 times [2024-11-10 09:21:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793531154] [2024-11-10 09:21:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:18,920 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 [2024-11-10 09:21:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:18,922 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) [2024-11-10 09:21:18,923 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 [2024-11-10 09:21:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:19,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 09:21:19,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:19,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-10 09:21:19,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-10 09:21:19,304 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 [2024-11-10 09:21:19,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:19,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:19,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-10 09:21:19,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:19,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2024-11-10 09:21:19,646 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 [2024-11-10 09:21:19,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:19,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 13 [2024-11-10 09:21:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-10 09:21:19,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-10 09:21:19,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:19,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793531154] [2024-11-10 09:21:19,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793531154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:21:19,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:21:19,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-11-10 09:21:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037360682] [2024-11-10 09:21:19,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:21:19,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:21:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:21:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:21:19,922 INFO L87 Difference]: Start difference. First operand 877 states and 1164 transitions. Second operand has 16 states, 14 states have (on average 9.5) internal successors, (133), 16 states have internal predecessors, (133), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-10 09:21:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:21,106 INFO L93 Difference]: Finished difference Result 1676 states and 2214 transitions. [2024-11-10 09:21:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 09:21:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.5) internal successors, (133), 16 states have internal predecessors, (133), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 150 [2024-11-10 09:21:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:21,110 INFO L225 Difference]: With dead ends: 1676 [2024-11-10 09:21:21,110 INFO L226 Difference]: Without dead ends: 918 [2024-11-10 09:21:21,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:21:21,112 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 465 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:21,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 924 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 09:21:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-10 09:21:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 877. [2024-11-10 09:21:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 776 states have (on average 1.2809278350515463) internal successors, (994), 782 states have internal predecessors, (994), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-10 09:21:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1160 transitions. [2024-11-10 09:21:21,150 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1160 transitions. Word has length 150 [2024-11-10 09:21:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:21,151 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1160 transitions. [2024-11-10 09:21:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.5) internal successors, (133), 16 states have internal predecessors, (133), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-10 09:21:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1160 transitions. [2024-11-10 09:21:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:21,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:21,152 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:21,158 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 (20)] Ended with exit code 0 [2024-11-10 09:21:21,352 WARN L453 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 [2024-11-10 09:21:21,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:21,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash -593803678, now seen corresponding path program 1 times [2024-11-10 09:21:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195886202] [2024-11-10 09:21:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:21,353 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 [2024-11-10 09:21:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:21,354 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) [2024-11-10 09:21:21,355 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 [2024-11-10 09:21:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:21,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 09:21:21,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:21,570 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 [2024-11-10 09:21:21,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-10 09:21:21,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:21,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2024-11-10 09:21:21,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:21,741 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 58 treesize of output 22 [2024-11-10 09:21:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:21,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:21,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195886202] [2024-11-10 09:21:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195886202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:21:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106065252] [2024-11-10 09:21:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:21:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:21:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:21,811 INFO L87 Difference]: Start difference. First operand 877 states and 1160 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:22,601 INFO L93 Difference]: Finished difference Result 1595 states and 2116 transitions. [2024-11-10 09:21:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 09:21:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:22,606 INFO L225 Difference]: With dead ends: 1595 [2024-11-10 09:21:22,606 INFO L226 Difference]: Without dead ends: 1214 [2024-11-10 09:21:22,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:21:22,607 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 211 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:22,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1379 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:21:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2024-11-10 09:21:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 965. [2024-11-10 09:21:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 864 states have (on average 1.2962962962962963) internal successors, (1120), 870 states have internal predecessors, (1120), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-10 09:21:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1286 transitions. [2024-11-10 09:21:22,639 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1286 transitions. Word has length 152 [2024-11-10 09:21:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:22,640 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1286 transitions. [2024-11-10 09:21:22,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1286 transitions. [2024-11-10 09:21:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:22,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:22,641 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:22,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:22,841 WARN L453 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 [2024-11-10 09:21:22,841 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:22,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1590876031, now seen corresponding path program 1 times [2024-11-10 09:21:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182809240] [2024-11-10 09:21:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:22,842 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 [2024-11-10 09:21:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:22,843 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) [2024-11-10 09:21:22,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-10 09:21:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 09:21:23,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:23,079 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 [2024-11-10 09:21:23,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:21:23,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:21:23,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:23,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:23,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:21:23,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:23,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2024-11-10 09:21:23,241 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 [2024-11-10 09:21:23,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:23,367 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 66 treesize of output 28 [2024-11-10 09:21:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-10 09:21:24,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:24,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182809240] [2024-11-10 09:21:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182809240] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:24,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-11-10 09:21:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518444094] [2024-11-10 09:21:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:24,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:21:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:21:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:21:24,906 INFO L87 Difference]: Start difference. First operand 965 states and 1286 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:25,897 INFO L93 Difference]: Finished difference Result 1929 states and 2564 transitions. [2024-11-10 09:21:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:21:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:25,902 INFO L225 Difference]: With dead ends: 1929 [2024-11-10 09:21:25,902 INFO L226 Difference]: Without dead ends: 1476 [2024-11-10 09:21:25,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:21:25,903 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 320 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:25,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 977 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:21:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-11-10 09:21:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1262. [2024-11-10 09:21:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1142 states have (on average 1.295971978984238) internal successors, (1480), 1152 states have internal predecessors, (1480), 97 states have call successors, (97), 22 states have call predecessors, (97), 22 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:21:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1674 transitions. [2024-11-10 09:21:25,947 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1674 transitions. Word has length 152 [2024-11-10 09:21:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:25,947 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1674 transitions. [2024-11-10 09:21:25,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1674 transitions. [2024-11-10 09:21:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:25,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:25,948 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:25,955 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 [2024-11-10 09:21:26,149 WARN L453 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 [2024-11-10 09:21:26,149 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash 431688321, now seen corresponding path program 1 times [2024-11-10 09:21:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:26,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630181754] [2024-11-10 09:21:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:26,150 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 [2024-11-10 09:21:26,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:26,151 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) [2024-11-10 09:21:26,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-10 09:21:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 09:21:26,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:26,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:21:26,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:21:26,386 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 [2024-11-10 09:21:26,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:26,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:26,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-10 09:21:26,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:26,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 52 [2024-11-10 09:21:26,573 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 [2024-11-10 09:21:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-10 09:21:26,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:27,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630181754] [2024-11-10 09:21:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630181754] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2024-11-10 09:21:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622353177] [2024-11-10 09:21:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:21:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:21:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-10 09:21:27,459 INFO L87 Difference]: Start difference. First operand 1262 states and 1674 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:28,716 INFO L93 Difference]: Finished difference Result 2876 states and 3816 transitions. [2024-11-10 09:21:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:21:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:28,723 INFO L225 Difference]: With dead ends: 2876 [2024-11-10 09:21:28,723 INFO L226 Difference]: Without dead ends: 2141 [2024-11-10 09:21:28,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 09:21:28,725 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 312 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:28,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 2129 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 09:21:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2024-11-10 09:21:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1391. [2024-11-10 09:21:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1271 states have (on average 1.3107789142407553) internal successors, (1666), 1281 states have internal predecessors, (1666), 97 states have call successors, (97), 22 states have call predecessors, (97), 22 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:21:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1860 transitions. [2024-11-10 09:21:28,786 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1860 transitions. Word has length 152 [2024-11-10 09:21:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:28,786 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1860 transitions. [2024-11-10 09:21:28,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1860 transitions. [2024-11-10 09:21:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:28,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:28,788 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:28,795 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 [2024-11-10 09:21:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:28,989 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -565384032, now seen corresponding path program 1 times [2024-11-10 09:21:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741045645] [2024-11-10 09:21:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:28,990 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 [2024-11-10 09:21:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:28,991 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:28,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-10 09:21:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 09:21:29,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:29,220 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 [2024-11-10 09:21:29,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-10 09:21:29,278 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 [2024-11-10 09:21:29,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:29,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 09:21:29,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-10 09:21:29,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-10 09:21:29,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 09:21:29,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:29,622 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 56 treesize of output 26 [2024-11-10 09:21:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 377 proven. 12 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-10 09:21:29,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:29,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741045645] [2024-11-10 09:21:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741045645] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2024-11-10 09:21:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672282502] [2024-11-10 09:21:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:29,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:21:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:29,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:21:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:21:29,906 INFO L87 Difference]: Start difference. First operand 1391 states and 1860 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:30,686 INFO L93 Difference]: Finished difference Result 2795 states and 3726 transitions. [2024-11-10 09:21:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 09:21:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:30,692 INFO L225 Difference]: With dead ends: 2795 [2024-11-10 09:21:30,693 INFO L226 Difference]: Without dead ends: 1940 [2024-11-10 09:21:30,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2024-11-10 09:21:30,694 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 315 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:30,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1722 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:21:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-10 09:21:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1454. [2024-11-10 09:21:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1334 states have (on average 1.31784107946027) internal successors, (1758), 1344 states have internal predecessors, (1758), 97 states have call successors, (97), 22 states have call predecessors, (97), 22 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:21:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1952 transitions. [2024-11-10 09:21:30,742 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1952 transitions. Word has length 152 [2024-11-10 09:21:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:30,742 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1952 transitions. [2024-11-10 09:21:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1952 transitions. [2024-11-10 09:21:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:30,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:30,744 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:30,751 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 (24)] Ended with exit code 0 [2024-11-10 09:21:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:30,945 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:30,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash -615962270, now seen corresponding path program 1 times [2024-11-10 09:21:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372811594] [2024-11-10 09:21:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:30,946 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 [2024-11-10 09:21:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:30,947 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) [2024-11-10 09:21:30,956 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 [2024-11-10 09:21:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:31,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:21:31,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:31,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-10 09:21:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-10 09:21:31,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:31,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:31,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372811594] [2024-11-10 09:21:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372811594] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:31,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:31,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-10 09:21:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112170824] [2024-11-10 09:21:31,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:31,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:21:31,391 INFO L87 Difference]: Start difference. First operand 1454 states and 1952 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:31,477 INFO L93 Difference]: Finished difference Result 2654 states and 3567 transitions. [2024-11-10 09:21:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:31,482 INFO L225 Difference]: With dead ends: 2654 [2024-11-10 09:21:31,482 INFO L226 Difference]: Without dead ends: 1352 [2024-11-10 09:21:31,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:21:31,484 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 174 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:31,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 561 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-10 09:21:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1343. [2024-11-10 09:21:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1223 states have (on average 1.313982011447261) internal successors, (1607), 1233 states have internal predecessors, (1607), 97 states have call successors, (97), 22 states have call predecessors, (97), 22 states have return successors, (97), 87 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-10 09:21:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1801 transitions. [2024-11-10 09:21:31,546 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1801 transitions. Word has length 152 [2024-11-10 09:21:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:31,546 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1801 transitions. [2024-11-10 09:21:31,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1801 transitions. [2024-11-10 09:21:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:31,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:31,547 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:31,553 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 [2024-11-10 09:21:31,747 WARN L453 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 [2024-11-10 09:21:31,748 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:31,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 733665451, now seen corresponding path program 1 times [2024-11-10 09:21:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337536733] [2024-11-10 09:21:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:31,749 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 [2024-11-10 09:21:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:31,750 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) [2024-11-10 09:21:31,751 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 [2024-11-10 09:21:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:31,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:21:31,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:32,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:32,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337536733] [2024-11-10 09:21:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337536733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:32,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742781693] [2024-11-10 09:21:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:32,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:32,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:32,063 INFO L87 Difference]: Start difference. First operand 1343 states and 1801 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:32,564 INFO L93 Difference]: Finished difference Result 3755 states and 5029 transitions. [2024-11-10 09:21:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:21:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:32,573 INFO L225 Difference]: With dead ends: 3755 [2024-11-10 09:21:32,573 INFO L226 Difference]: Without dead ends: 2551 [2024-11-10 09:21:32,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:32,575 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 296 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:32,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 797 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:21:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2024-11-10 09:21:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2523. [2024-11-10 09:21:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2289 states have (on average 1.2996941896024465) internal successors, (2975), 2312 states have internal predecessors, (2975), 190 states have call successors, (190), 43 states have call predecessors, (190), 43 states have return successors, (190), 167 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:21:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3355 transitions. [2024-11-10 09:21:32,674 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3355 transitions. Word has length 152 [2024-11-10 09:21:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:32,674 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3355 transitions. [2024-11-10 09:21:32,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3355 transitions. [2024-11-10 09:21:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:32,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:32,676 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:32,686 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 (26)] Ended with exit code 0 [2024-11-10 09:21:32,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:32,877 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:32,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash 799935467, now seen corresponding path program 1 times [2024-11-10 09:21:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594699755] [2024-11-10 09:21:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:32,878 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 [2024-11-10 09:21:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:32,880 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:32,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-10 09:21:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:33,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:21:33,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:33,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:33,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594699755] [2024-11-10 09:21:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594699755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:33,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:33,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488716796] [2024-11-10 09:21:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:33,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:33,183 INFO L87 Difference]: Start difference. First operand 2523 states and 3355 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:33,711 INFO L93 Difference]: Finished difference Result 4846 states and 6442 transitions. [2024-11-10 09:21:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:21:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:33,718 INFO L225 Difference]: With dead ends: 4846 [2024-11-10 09:21:33,718 INFO L226 Difference]: Without dead ends: 2499 [2024-11-10 09:21:33,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:33,720 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 253 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:33,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 859 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:21:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2024-11-10 09:21:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2471. [2024-11-10 09:21:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2237 states have (on average 1.2896736700938758) internal successors, (2885), 2260 states have internal predecessors, (2885), 190 states have call successors, (190), 43 states have call predecessors, (190), 43 states have return successors, (190), 167 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:21:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3265 transitions. [2024-11-10 09:21:33,811 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3265 transitions. Word has length 152 [2024-11-10 09:21:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:33,812 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3265 transitions. [2024-11-10 09:21:33,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3265 transitions. [2024-11-10 09:21:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:33,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:33,813 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:33,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:34,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:34,013 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:34,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2082472942, now seen corresponding path program 1 times [2024-11-10 09:21:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518135318] [2024-11-10 09:21:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:34,014 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 [2024-11-10 09:21:34,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:34,015 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) [2024-11-10 09:21:34,016 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 [2024-11-10 09:21:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:34,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 09:21:34,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:34,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-10 09:21:34,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-10 09:21:34,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:34,453 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 67 treesize of output 31 [2024-11-10 09:21:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-10 09:21:34,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:34,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518135318] [2024-11-10 09:21:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518135318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:34,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:34,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418953121] [2024-11-10 09:21:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:34,478 INFO L87 Difference]: Start difference. First operand 2471 states and 3265 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:34,760 INFO L93 Difference]: Finished difference Result 2584 states and 3395 transitions. [2024-11-10 09:21:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-10 09:21:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:34,767 INFO L225 Difference]: With dead ends: 2584 [2024-11-10 09:21:34,767 INFO L226 Difference]: Without dead ends: 2581 [2024-11-10 09:21:34,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:34,768 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 135 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:34,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 792 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2024-11-10 09:21:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2581. [2024-11-10 09:21:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2339 states have (on average 1.2770414707139803) internal successors, (2987), 2362 states have internal predecessors, (2987), 190 states have call successors, (190), 51 states have call predecessors, (190), 51 states have return successors, (190), 167 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:21:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3367 transitions. [2024-11-10 09:21:34,873 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3367 transitions. Word has length 152 [2024-11-10 09:21:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:34,873 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 3367 transitions. [2024-11-10 09:21:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3367 transitions. [2024-11-10 09:21:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:34,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:34,875 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:34,881 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 [2024-11-10 09:21:35,075 WARN L453 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 [2024-11-10 09:21:35,076 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:35,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2053843791, now seen corresponding path program 1 times [2024-11-10 09:21:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:35,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905841551] [2024-11-10 09:21:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:35,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 [2024-11-10 09:21:35,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:35,078 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) [2024-11-10 09:21:35,078 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 [2024-11-10 09:21:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:35,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 09:21:35,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:35,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:21:35,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-11-10 09:21:35,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:35,998 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 203 treesize of output 77 [2024-11-10 09:21:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-10 09:21:36,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:36,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905841551] [2024-11-10 09:21:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905841551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1667733058] [2024-11-10 09:21:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:36,163 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:21:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:21:36,165 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:21:36,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-10 09:21:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:36,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 09:21:36,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:36,816 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 [2024-11-10 09:21:37,480 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 103 treesize of output 59 [2024-11-10 09:21:37,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:37,690 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 173 treesize of output 77 [2024-11-10 09:21:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-10 09:21:37,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1667733058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:37,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:21:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-10 09:21:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036079743] [2024-11-10 09:21:37,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:21:37,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:21:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:37,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:21:37,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:21:37,832 INFO L87 Difference]: Start difference. First operand 2581 states and 3367 transitions. Second operand has 16 states, 16 states have (on average 8.6875) internal successors, (139), 15 states have internal predecessors, (139), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-10 09:21:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:38,673 INFO L93 Difference]: Finished difference Result 7551 states and 9813 transitions. [2024-11-10 09:21:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:21:38,674 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 15 states have internal predecessors, (139), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 152 [2024-11-10 09:21:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:38,695 INFO L225 Difference]: With dead ends: 7551 [2024-11-10 09:21:38,696 INFO L226 Difference]: Without dead ends: 5154 [2024-11-10 09:21:38,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 371 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:21:38,701 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 571 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:38,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1369 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:21:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2024-11-10 09:21:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 5138. [2024-11-10 09:21:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5138 states, 4647 states have (on average 1.2672692059393156) internal successors, (5889), 4706 states have internal predecessors, (5889), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-10 09:21:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5138 states to 5138 states and 6641 transitions. [2024-11-10 09:21:38,957 INFO L78 Accepts]: Start accepts. Automaton has 5138 states and 6641 transitions. Word has length 152 [2024-11-10 09:21:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:38,957 INFO L471 AbstractCegarLoop]: Abstraction has 5138 states and 6641 transitions. [2024-11-10 09:21:38,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 15 states have internal predecessors, (139), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-10 09:21:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 6641 transitions. [2024-11-10 09:21:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:38,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:38,963 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:38,969 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 [2024-11-10 09:21:39,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:39,363 WARN L453 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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 09:21:39,363 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:39,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash -311033456, now seen corresponding path program 1 times [2024-11-10 09:21:39,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:39,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642856049] [2024-11-10 09:21:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:39,364 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 [2024-11-10 09:21:39,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:39,365 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) [2024-11-10 09:21:39,366 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 [2024-11-10 09:21:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 09:21:39,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:39,563 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 [2024-11-10 09:21:39,590 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 [2024-11-10 09:21:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:39,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:39,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642856049] [2024-11-10 09:21:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642856049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:39,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112041382] [2024-11-10 09:21:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:39,599 INFO L87 Difference]: Start difference. First operand 5138 states and 6641 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:39,931 INFO L93 Difference]: Finished difference Result 9929 states and 12836 transitions. [2024-11-10 09:21:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:39,942 INFO L225 Difference]: With dead ends: 9929 [2024-11-10 09:21:39,942 INFO L226 Difference]: Without dead ends: 5138 [2024-11-10 09:21:39,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:39,948 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 132 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:39,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 783 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2024-11-10 09:21:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 5138. [2024-11-10 09:21:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5138 states, 4647 states have (on average 1.256079190875834) internal successors, (5837), 4706 states have internal predecessors, (5837), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-10 09:21:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5138 states to 5138 states and 6589 transitions. [2024-11-10 09:21:40,197 INFO L78 Accepts]: Start accepts. Automaton has 5138 states and 6589 transitions. Word has length 152 [2024-11-10 09:21:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:40,197 INFO L471 AbstractCegarLoop]: Abstraction has 5138 states and 6589 transitions. [2024-11-10 09:21:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 6589 transitions. [2024-11-10 09:21:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:40,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:40,199 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:40,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-10 09:21:40,399 WARN L453 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 [2024-11-10 09:21:40,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -507546961, now seen corresponding path program 1 times [2024-11-10 09:21:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449070947] [2024-11-10 09:21:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:40,401 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 [2024-11-10 09:21:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:40,403 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) [2024-11-10 09:21:40,405 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 [2024-11-10 09:21:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:40,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:21:40,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:40,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-10 09:21:40,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-10 09:21:40,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 09:21:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:40,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:40,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449070947] [2024-11-10 09:21:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449070947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:21:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923299368] [2024-11-10 09:21:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:21:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:21:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:40,787 INFO L87 Difference]: Start difference. First operand 5138 states and 6589 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:41,724 INFO L93 Difference]: Finished difference Result 10148 states and 13008 transitions. [2024-11-10 09:21:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:21:41,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:41,736 INFO L225 Difference]: With dead ends: 10148 [2024-11-10 09:21:41,737 INFO L226 Difference]: Without dead ends: 5357 [2024-11-10 09:21:41,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:21:41,743 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 134 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:41,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1481 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:21:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2024-11-10 09:21:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5330. [2024-11-10 09:21:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5330 states, 4839 states have (on average 1.2459185782186402) internal successors, (6029), 4898 states have internal predecessors, (6029), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-10 09:21:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 6781 transitions. [2024-11-10 09:21:42,013 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 6781 transitions. Word has length 152 [2024-11-10 09:21:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 5330 states and 6781 transitions. [2024-11-10 09:21:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 6781 transitions. [2024-11-10 09:21:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:42,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:42,015 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:42,023 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 [2024-11-10 09:21:42,216 WARN L453 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 [2024-11-10 09:21:42,216 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1013105586, now seen corresponding path program 1 times [2024-11-10 09:21:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305461723] [2024-11-10 09:21:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:42,218 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 [2024-11-10 09:21:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:42,220 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) [2024-11-10 09:21:42,221 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 [2024-11-10 09:21:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:42,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:42,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:42,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 09:21:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:42,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:42,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:42,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305461723] [2024-11-10 09:21:42,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305461723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:42,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:42,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500234338] [2024-11-10 09:21:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:42,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:42,500 INFO L87 Difference]: Start difference. First operand 5330 states and 6781 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:42,989 INFO L93 Difference]: Finished difference Result 10170 states and 12940 transitions. [2024-11-10 09:21:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:21:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:43,019 INFO L225 Difference]: With dead ends: 10170 [2024-11-10 09:21:43,019 INFO L226 Difference]: Without dead ends: 5187 [2024-11-10 09:21:43,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:43,023 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 128 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:43,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 484 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2024-11-10 09:21:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5164. [2024-11-10 09:21:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 4673 states have (on average 1.2388187459875883) internal successors, (5789), 4732 states have internal predecessors, (5789), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-10 09:21:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 6541 transitions. [2024-11-10 09:21:43,320 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 6541 transitions. Word has length 152 [2024-11-10 09:21:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:43,321 INFO L471 AbstractCegarLoop]: Abstraction has 5164 states and 6541 transitions. [2024-11-10 09:21:43,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:21:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 6541 transitions. [2024-11-10 09:21:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:21:43,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:43,323 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:43,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2024-11-10 09:21:43,524 WARN L453 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 [2024-11-10 09:21:43,524 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:43,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash -931564592, now seen corresponding path program 1 times [2024-11-10 09:21:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:43,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053546115] [2024-11-10 09:21:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:43,525 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 [2024-11-10 09:21:43,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:43,528 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:43,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-10 09:21:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:43,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:21:43,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-10 09:21:43,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:43,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:43,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053546115] [2024-11-10 09:21:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053546115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074864206] [2024-11-10 09:21:43,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:43,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:43,772 INFO L87 Difference]: Start difference. First operand 5164 states and 6541 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:44,056 INFO L93 Difference]: Finished difference Result 10142 states and 12843 transitions. [2024-11-10 09:21:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:44,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-10 09:21:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:44,068 INFO L225 Difference]: With dead ends: 10142 [2024-11-10 09:21:44,068 INFO L226 Difference]: Without dead ends: 5164 [2024-11-10 09:21:44,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:44,073 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:44,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2024-11-10 09:21:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5164. [2024-11-10 09:21:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 4673 states have (on average 1.2358228118981383) internal successors, (5775), 4732 states have internal predecessors, (5775), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-10 09:21:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 6527 transitions. [2024-11-10 09:21:44,371 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 6527 transitions. Word has length 152 [2024-11-10 09:21:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:44,371 INFO L471 AbstractCegarLoop]: Abstraction has 5164 states and 6527 transitions. [2024-11-10 09:21:44,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 6527 transitions. [2024-11-10 09:21:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 09:21:44,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:44,373 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:44,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:44,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:44,574 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash -431906989, now seen corresponding path program 1 times [2024-11-10 09:21:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620625729] [2024-11-10 09:21:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:44,575 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 [2024-11-10 09:21:44,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:44,576 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:44,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process