./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-p_file-76.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 282dfa0bfe333efa3c47884b86159bc6597e0a79cae24c957b75e6e92350e420 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:37:43,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:37:43,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:37:43,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:37:43,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:37:44,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:37:44,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:37:44,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:37:44,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:37:44,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:37:44,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:37:44,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:37:44,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:37:44,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:37:44,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:37:44,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:37:44,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:37:44,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:37:44,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:37:44,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:37:44,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:37:44,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:37:44,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:37:44,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:37:44,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:37:44,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:37:44,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:37:44,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:37:44,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:37:44,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:37:44,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:37:44,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:37:44,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:37:44,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:37:44,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:37:44,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:37:44,020 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 -> 282dfa0bfe333efa3c47884b86159bc6597e0a79cae24c957b75e6e92350e420 [2024-11-16 18:37:44,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:37:44,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:37:44,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:37:44,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:37:44,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:37:44,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2024-11-16 18:37:45,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:37:45,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:37:45,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2024-11-16 18:37:45,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc7466aa/f04e671fbcb846548f44f095f9fa1546/FLAGd47f1f702 [2024-11-16 18:37:45,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc7466aa/f04e671fbcb846548f44f095f9fa1546 [2024-11-16 18:37:45,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:37:45,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:37:45,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:37:45,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:37:45,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:37:45,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:45,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513447cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45, skipping insertion in model container [2024-11-16 18:37:45,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:45,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:37:45,877 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-p_file-76.i[916,929] [2024-11-16 18:37:45,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:37:45,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:37:45,945 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-p_file-76.i[916,929] [2024-11-16 18:37:45,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:37:45,998 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:37:45,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45 WrapperNode [2024-11-16 18:37:45,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:37:45,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:37:46,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:37:46,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:37:46,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,042 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-11-16 18:37:46,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:37:46,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:37:46,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:37:46,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:37:46,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,073 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 11, 6, 6, 14, 3, 12, 12, 10, 10, 6, 7, 8]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1]. [2024-11-16 18:37:46,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:37:46,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:37:46,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:37:46,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:37:46,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (1/1) ... [2024-11-16 18:37:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:37:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:37:46,156 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-16 18:37:46,160 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-16 18:37:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:37:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-16 18:37:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-16 18:37:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-16 18:37:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-16 18:37:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-16 18:37:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-16 18:37:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:37:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:37:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:37:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:37:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-16 18:37:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-16 18:37:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-16 18:37:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-16 18:37:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-16 18:37:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-16 18:37:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-16 18:37:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-16 18:37:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:37:46,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:37:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:37:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-16 18:37:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-16 18:37:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-16 18:37:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-16 18:37:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:37:46,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:37:46,377 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:37:46,379 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:37:46,666 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~ite66#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem65#1;havoc property_#t~mem64#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~short76#1;havoc property_#t~mem77#1;havoc property_#t~ite93#1;havoc property_#t~mem83#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~ite108#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1; [2024-11-16 18:37:46,701 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-16 18:37:46,701 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:37:46,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:37:46,716 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:37:46,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:46 BoogieIcfgContainer [2024-11-16 18:37:46,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:37:46,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:37:46,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:37:46,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:37:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:37:45" (1/3) ... [2024-11-16 18:37:46,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b49a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:46, skipping insertion in model container [2024-11-16 18:37:46,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:45" (2/3) ... [2024-11-16 18:37:46,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b49a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:46, skipping insertion in model container [2024-11-16 18:37:46,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:46" (3/3) ... [2024-11-16 18:37:46,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-76.i [2024-11-16 18:37:46,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:37:46,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:37:46,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:37:46,796 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;@6ed7144b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:37:46,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:37:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:37:46,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:46,814 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:46,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 801920151, now seen corresponding path program 1 times [2024-11-16 18:37:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396492352] [2024-11-16 18:37:46,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396492352] [2024-11-16 18:37:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396492352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:47,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:37:47,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849025593] [2024-11-16 18:37:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:37:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:37:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:37:47,265 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:37:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:47,291 INFO L93 Difference]: Finished difference Result 198 states and 306 transitions. [2024-11-16 18:37:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:37:47,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-11-16 18:37:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:47,325 INFO L225 Difference]: With dead ends: 198 [2024-11-16 18:37:47,325 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 18:37:47,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 18:37:47,333 INFO L432 NwaCegarLoop]: 135 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, 135 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-16 18:37:47,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 18:37:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 18:37:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-11-16 18:37:47,383 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 121 [2024-11-16 18:37:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-11-16 18:37:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:37:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-11-16 18:37:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:37:47,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:47,389 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:47,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:37:47,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:47,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 691868755, now seen corresponding path program 1 times [2024-11-16 18:37:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980810929] [2024-11-16 18:37:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:47,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980810929] [2024-11-16 18:37:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980810929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:37:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643344858] [2024-11-16 18:37:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:47,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:37:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:37:47,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:37:47,706 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:47,729 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2024-11-16 18:37:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:37:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-16 18:37:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:47,733 INFO L225 Difference]: With dead ends: 189 [2024-11-16 18:37:47,734 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 18:37:47,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 18:37:47,735 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:47,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 18:37:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 18:37:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-16 18:37:47,746 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 121 [2024-11-16 18:37:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:47,747 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-16 18:37:47,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-16 18:37:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:37:47,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:47,749 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:37:47,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:47,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 903219668, now seen corresponding path program 1 times [2024-11-16 18:37:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672251180] [2024-11-16 18:37:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:47,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672251180] [2024-11-16 18:37:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672251180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:47,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:37:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121341009] [2024-11-16 18:37:47,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:47,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:37:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:47,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:37:47,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:37:47,969 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:47,993 INFO L93 Difference]: Finished difference Result 189 states and 265 transitions. [2024-11-16 18:37:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:37:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-16 18:37:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:47,995 INFO L225 Difference]: With dead ends: 189 [2024-11-16 18:37:47,995 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 18:37:47,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 18:37:47,996 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:47,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 18:37:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 18:37:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-16 18:37:48,010 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 121 [2024-11-16 18:37:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:48,010 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-16 18:37:48,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-16 18:37:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 18:37:48,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:48,012 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:48,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:37:48,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:48,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2037753114, now seen corresponding path program 1 times [2024-11-16 18:37:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061137337] [2024-11-16 18:37:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061137337] [2024-11-16 18:37:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061137337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:37:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854261035] [2024-11-16 18:37:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:37:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:37:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:37:48,910 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-16 18:37:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:49,261 INFO L93 Difference]: Finished difference Result 248 states and 340 transitions. [2024-11-16 18:37:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:37:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 122 [2024-11-16 18:37:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:49,263 INFO L225 Difference]: With dead ends: 248 [2024-11-16 18:37:49,263 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 18:37:49,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:37:49,264 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 415 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:49,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 753 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:37:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 18:37:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 110. [2024-11-16 18:37:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2024-11-16 18:37:49,284 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 122 [2024-11-16 18:37:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:49,287 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2024-11-16 18:37:49,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-16 18:37:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-16 18:37:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:37:49,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:49,288 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:49,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:37:49,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 430525736, now seen corresponding path program 1 times [2024-11-16 18:37:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915556476] [2024-11-16 18:37:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:49,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:49,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915556476] [2024-11-16 18:37:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915556476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:49,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130079719] [2024-11-16 18:37:49,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:49,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:49,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:49,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:49,536 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:49,666 INFO L93 Difference]: Finished difference Result 295 states and 402 transitions. [2024-11-16 18:37:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:49,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-16 18:37:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:49,668 INFO L225 Difference]: With dead ends: 295 [2024-11-16 18:37:49,668 INFO L226 Difference]: Without dead ends: 188 [2024-11-16 18:37:49,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:49,669 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 118 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:49,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 603 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-16 18:37:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2024-11-16 18:37:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-16 18:37:49,682 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 124 [2024-11-16 18:37:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:49,683 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-16 18:37:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-16 18:37:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:37:49,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:49,685 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:37:49,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash -257194929, now seen corresponding path program 1 times [2024-11-16 18:37:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275149195] [2024-11-16 18:37:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275149195] [2024-11-16 18:37:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275149195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695797938] [2024-11-16 18:37:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:49,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:49,875 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:49,907 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2024-11-16 18:37:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-16 18:37:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:49,910 INFO L225 Difference]: With dead ends: 220 [2024-11-16 18:37:49,911 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 18:37:49,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-16 18:37:49,912 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 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-16 18:37:49,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 18:37:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-16 18:37:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 95 states have internal predecessors, (122), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2024-11-16 18:37:49,925 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 124 [2024-11-16 18:37:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:49,925 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2024-11-16 18:37:49,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2024-11-16 18:37:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 18:37:49,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:49,926 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:49,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:37:49,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -260541462, now seen corresponding path program 1 times [2024-11-16 18:37:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819990947] [2024-11-16 18:37:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819990947] [2024-11-16 18:37:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819990947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:37:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201374568] [2024-11-16 18:37:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:37:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:50,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:37:50,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:37:50,219 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:50,362 INFO L93 Difference]: Finished difference Result 287 states and 383 transitions. [2024-11-16 18:37:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:37:50,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-16 18:37:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:50,363 INFO L225 Difference]: With dead ends: 287 [2024-11-16 18:37:50,363 INFO L226 Difference]: Without dead ends: 177 [2024-11-16 18:37:50,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:37:50,364 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 144 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:50,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 734 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-16 18:37:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 114. [2024-11-16 18:37:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-11-16 18:37:50,381 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 126 [2024-11-16 18:37:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:50,381 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-11-16 18:37:50,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-11-16 18:37:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 18:37:50,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:50,383 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:50,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:37:50,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:50,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1941990583, now seen corresponding path program 1 times [2024-11-16 18:37:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676023609] [2024-11-16 18:37:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676023609] [2024-11-16 18:37:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676023609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:50,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:50,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:37:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916713056] [2024-11-16 18:37:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:50,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:37:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:50,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:37:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:37:50,572 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:50,608 INFO L93 Difference]: Finished difference Result 229 states and 306 transitions. [2024-11-16 18:37:50,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:37:50,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-16 18:37:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:50,610 INFO L225 Difference]: With dead ends: 229 [2024-11-16 18:37:50,610 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 18:37:50,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-16 18:37:50,611 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:50,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 18:37:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-11-16 18:37:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.268041237113402) internal successors, (123), 97 states have internal predecessors, (123), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2024-11-16 18:37:50,618 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 153 transitions. Word has length 126 [2024-11-16 18:37:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:50,619 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 153 transitions. [2024-11-16 18:37:50,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 153 transitions. [2024-11-16 18:37:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:37:50,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:50,620 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:50,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:37:50,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:50,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1630806700, now seen corresponding path program 1 times [2024-11-16 18:37:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:50,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177801760] [2024-11-16 18:37:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177801760] [2024-11-16 18:37:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177801760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:37:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149893306] [2024-11-16 18:37:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:37:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:37:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:37:50,852 INFO L87 Difference]: Start difference. First operand 115 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:50,897 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2024-11-16 18:37:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-16 18:37:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:50,899 INFO L225 Difference]: With dead ends: 236 [2024-11-16 18:37:50,899 INFO L226 Difference]: Without dead ends: 124 [2024-11-16 18:37:50,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 18:37:50,900 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:50,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 374 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-16 18:37:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-11-16 18:37:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2024-11-16 18:37:50,908 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 128 [2024-11-16 18:37:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:50,909 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2024-11-16 18:37:50,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2024-11-16 18:37:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:37:50,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:50,910 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:50,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:37:50,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:50,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1156608787, now seen corresponding path program 1 times [2024-11-16 18:37:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:50,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84625572] [2024-11-16 18:37:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84625572] [2024-11-16 18:37:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84625572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:37:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780823063] [2024-11-16 18:37:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:37:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:37:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:37:51,720 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-16 18:37:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:52,213 INFO L93 Difference]: Finished difference Result 302 states and 395 transitions. [2024-11-16 18:37:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:37:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2024-11-16 18:37:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:52,215 INFO L225 Difference]: With dead ends: 302 [2024-11-16 18:37:52,215 INFO L226 Difference]: Without dead ends: 187 [2024-11-16 18:37:52,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:37:52,216 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 258 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:52,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1018 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:37:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-16 18:37:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 110. [2024-11-16 18:37:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 146 transitions. [2024-11-16 18:37:52,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 146 transitions. Word has length 128 [2024-11-16 18:37:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:52,228 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 146 transitions. [2024-11-16 18:37:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-16 18:37:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 146 transitions. [2024-11-16 18:37:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:37:52,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:52,229 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:52,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:37:52,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:52,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1576042539, now seen corresponding path program 1 times [2024-11-16 18:37:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461743372] [2024-11-16 18:37:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:52,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:52,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461743372] [2024-11-16 18:37:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461743372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:52,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947212875] [2024-11-16 18:37:52,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:52,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:52,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:52,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:52,405 INFO L87 Difference]: Start difference. First operand 110 states and 146 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:52,521 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2024-11-16 18:37:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-16 18:37:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:52,523 INFO L225 Difference]: With dead ends: 301 [2024-11-16 18:37:52,523 INFO L226 Difference]: Without dead ends: 194 [2024-11-16 18:37:52,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:52,524 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 104 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:52,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 630 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-16 18:37:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2024-11-16 18:37:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 102 states have internal predecessors, (128), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2024-11-16 18:37:52,536 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 128 [2024-11-16 18:37:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:52,536 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2024-11-16 18:37:52,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2024-11-16 18:37:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:37:52,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:52,538 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:52,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:37:52,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1913585466, now seen corresponding path program 1 times [2024-11-16 18:37:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362103355] [2024-11-16 18:37:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362103355] [2024-11-16 18:37:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362103355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:52,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:37:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681503549] [2024-11-16 18:37:52,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:37:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:37:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:37:52,681 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:52,704 INFO L93 Difference]: Finished difference Result 237 states and 313 transitions. [2024-11-16 18:37:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:37:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-16 18:37:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:52,705 INFO L225 Difference]: With dead ends: 237 [2024-11-16 18:37:52,705 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 18:37:52,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-16 18:37:52,706 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 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-16 18:37:52,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 18:37:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-16 18:37:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 102 states have internal predecessors, (126), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:37:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2024-11-16 18:37:52,714 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 128 [2024-11-16 18:37:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2024-11-16 18:37:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2024-11-16 18:37:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 18:37:52,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:52,716 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:52,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:37:52,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:52,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash -156303052, now seen corresponding path program 1 times [2024-11-16 18:37:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961578144] [2024-11-16 18:37:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961578144] [2024-11-16 18:37:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961578144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:37:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408261166] [2024-11-16 18:37:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:53,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:37:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:37:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:37:53,604 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:37:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:53,912 INFO L93 Difference]: Finished difference Result 344 states and 447 transitions. [2024-11-16 18:37:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:37:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-16 18:37:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:53,915 INFO L225 Difference]: With dead ends: 344 [2024-11-16 18:37:53,915 INFO L226 Difference]: Without dead ends: 227 [2024-11-16 18:37:53,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:37:53,916 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 298 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:53,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 929 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:37:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-16 18:37:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2024-11-16 18:37:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 192 states have (on average 1.2395833333333333) internal successors, (238), 193 states have internal predecessors, (238), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:37:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 290 transitions. [2024-11-16 18:37:53,939 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 290 transitions. Word has length 130 [2024-11-16 18:37:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:53,940 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 290 transitions. [2024-11-16 18:37:53,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:37:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 290 transitions. [2024-11-16 18:37:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 18:37:53,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:53,941 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:53,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:37:53,941 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash -790855867, now seen corresponding path program 1 times [2024-11-16 18:37:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741481002] [2024-11-16 18:37:53,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:53,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:54,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741481002] [2024-11-16 18:37:54,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741481002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:54,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:54,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721068442] [2024-11-16 18:37:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:54,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:54,086 INFO L87 Difference]: Start difference. First operand 223 states and 290 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:54,148 INFO L93 Difference]: Finished difference Result 450 states and 582 transitions. [2024-11-16 18:37:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:54,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-16 18:37:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:54,151 INFO L225 Difference]: With dead ends: 450 [2024-11-16 18:37:54,151 INFO L226 Difference]: Without dead ends: 230 [2024-11-16 18:37:54,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:54,152 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 59 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:54,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 654 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-16 18:37:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2024-11-16 18:37:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.2307692307692308) internal successors, (240), 196 states have internal predecessors, (240), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:37:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2024-11-16 18:37:54,173 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 131 [2024-11-16 18:37:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:54,173 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2024-11-16 18:37:54,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2024-11-16 18:37:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 18:37:54,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:54,174 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:54,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:37:54,175 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:54,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash -334356161, now seen corresponding path program 1 times [2024-11-16 18:37:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:54,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054088536] [2024-11-16 18:37:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:54,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:54,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054088536] [2024-11-16 18:37:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054088536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:37:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025712596] [2024-11-16 18:37:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:54,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:37:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:54,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:37:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:37:54,824 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:37:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:55,150 INFO L93 Difference]: Finished difference Result 386 states and 491 transitions. [2024-11-16 18:37:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:37:55,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-16 18:37:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:55,152 INFO L225 Difference]: With dead ends: 386 [2024-11-16 18:37:55,152 INFO L226 Difference]: Without dead ends: 383 [2024-11-16 18:37:55,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-16 18:37:55,153 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 201 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:55,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 835 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:37:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-16 18:37:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2024-11-16 18:37:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 321 states have internal predecessors, (384), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 18:37:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 484 transitions. [2024-11-16 18:37:55,206 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 484 transitions. Word has length 132 [2024-11-16 18:37:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 484 transitions. [2024-11-16 18:37:55,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 18:37:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 484 transitions. [2024-11-16 18:37:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 18:37:55,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:55,208 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:37:55,208 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:55,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -604774223, now seen corresponding path program 1 times [2024-11-16 18:37:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770070521] [2024-11-16 18:37:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770070521] [2024-11-16 18:37:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770070521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:55,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:55,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418546831] [2024-11-16 18:37:55,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:55,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:55,332 INFO L87 Difference]: Start difference. First operand 379 states and 484 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:55,410 INFO L93 Difference]: Finished difference Result 756 states and 960 transitions. [2024-11-16 18:37:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-16 18:37:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:55,412 INFO L225 Difference]: With dead ends: 756 [2024-11-16 18:37:55,412 INFO L226 Difference]: Without dead ends: 380 [2024-11-16 18:37:55,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:55,422 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:55,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 531 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:37:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-16 18:37:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2024-11-16 18:37:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 314 states have (on average 1.194267515923567) internal successors, (375), 317 states have internal predecessors, (375), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 18:37:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 475 transitions. [2024-11-16 18:37:55,465 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 475 transitions. Word has length 132 [2024-11-16 18:37:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:55,466 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 475 transitions. [2024-11-16 18:37:55,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 475 transitions. [2024-11-16 18:37:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 18:37:55,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:55,467 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:55,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:37:55,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:55,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -524673406, now seen corresponding path program 1 times [2024-11-16 18:37:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616790697] [2024-11-16 18:37:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616790697] [2024-11-16 18:37:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616790697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:55,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:55,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:37:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873005548] [2024-11-16 18:37:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:55,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:37:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:55,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:37:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:37:55,699 INFO L87 Difference]: Start difference. First operand 377 states and 475 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:55,856 INFO L93 Difference]: Finished difference Result 929 states and 1166 transitions. [2024-11-16 18:37:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:37:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-16 18:37:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:55,861 INFO L225 Difference]: With dead ends: 929 [2024-11-16 18:37:55,861 INFO L226 Difference]: Without dead ends: 555 [2024-11-16 18:37:55,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:37:55,863 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 79 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:55,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1344 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-16 18:37:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 550. [2024-11-16 18:37:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 467 states have (on average 1.1948608137044967) internal successors, (558), 472 states have internal predecessors, (558), 64 states have call successors, (64), 18 states have call predecessors, (64), 18 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 18:37:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 686 transitions. [2024-11-16 18:37:55,945 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 686 transitions. Word has length 133 [2024-11-16 18:37:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:55,945 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 686 transitions. [2024-11-16 18:37:55,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 686 transitions. [2024-11-16 18:37:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 18:37:55,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:55,948 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:55,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:37:55,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:55,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash 168428291, now seen corresponding path program 1 times [2024-11-16 18:37:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827903200] [2024-11-16 18:37:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827903200] [2024-11-16 18:37:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827903200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:56,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519232198] [2024-11-16 18:37:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:56,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:56,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:56,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:56,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:56,143 INFO L87 Difference]: Start difference. First operand 550 states and 686 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:56,302 INFO L93 Difference]: Finished difference Result 1160 states and 1450 transitions. [2024-11-16 18:37:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:56,303 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-16 18:37:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:56,305 INFO L225 Difference]: With dead ends: 1160 [2024-11-16 18:37:56,305 INFO L226 Difference]: Without dead ends: 613 [2024-11-16 18:37:56,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:56,307 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 103 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:56,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 791 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-16 18:37:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 607. [2024-11-16 18:37:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 499 states have (on average 1.182364729458918) internal successors, (590), 505 states have internal predecessors, (590), 85 states have call successors, (85), 22 states have call predecessors, (85), 22 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-16 18:37:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 760 transitions. [2024-11-16 18:37:56,381 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 760 transitions. Word has length 133 [2024-11-16 18:37:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:56,382 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 760 transitions. [2024-11-16 18:37:56,382 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 760 transitions. [2024-11-16 18:37:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 18:37:56,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:56,384 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:56,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 18:37:56,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:56,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash -996945678, now seen corresponding path program 1 times [2024-11-16 18:37:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539183360] [2024-11-16 18:37:56,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:37:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539183360] [2024-11-16 18:37:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539183360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:37:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315244856] [2024-11-16 18:37:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:37:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:37:56,893 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-16 18:37:56,894 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-16 18:37:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:57,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 18:37:57,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:37:57,297 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-16 18:37:57,464 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 17 [2024-11-16 18:37:57,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-16 18:37:57,530 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-16 18:37:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-16 18:37:57,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:37:57,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-16 18:37:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:37:57,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315244856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:37:57,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 18:37:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 19 [2024-11-16 18:37:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33022433] [2024-11-16 18:37:57,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 18:37:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:37:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:57,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:37:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:37:57,855 INFO L87 Difference]: Start difference. First operand 607 states and 760 transitions. Second operand has 19 states, 16 states have (on average 6.75) internal successors, (108), 19 states have internal predecessors, (108), 8 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 5 states have call predecessors, (36), 8 states have call successors, (36) [2024-11-16 18:37:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:58,701 INFO L93 Difference]: Finished difference Result 1176 states and 1452 transitions. [2024-11-16 18:37:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 18:37:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.75) internal successors, (108), 19 states have internal predecessors, (108), 8 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 5 states have call predecessors, (36), 8 states have call successors, (36) Word has length 134 [2024-11-16 18:37:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:58,704 INFO L225 Difference]: With dead ends: 1176 [2024-11-16 18:37:58,704 INFO L226 Difference]: Without dead ends: 601 [2024-11-16 18:37:58,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 18:37:58,707 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 308 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:58,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 810 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:37:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-16 18:37:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 584. [2024-11-16 18:37:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 459 states have (on average 1.1394335511982572) internal successors, (523), 465 states have internal predecessors, (523), 93 states have call successors, (93), 31 states have call predecessors, (93), 31 states have return successors, (93), 87 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-16 18:37:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 709 transitions. [2024-11-16 18:37:58,778 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 709 transitions. Word has length 134 [2024-11-16 18:37:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:58,778 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 709 transitions. [2024-11-16 18:37:58,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.75) internal successors, (108), 19 states have internal predecessors, (108), 8 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 5 states have call predecessors, (36), 8 states have call successors, (36) [2024-11-16 18:37:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 709 transitions. [2024-11-16 18:37:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 18:37:58,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:58,779 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:58,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:37:58,979 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-16 18:37:58,980 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:58,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1115937279, now seen corresponding path program 1 times [2024-11-16 18:37:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:58,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230418372] [2024-11-16 18:37:58,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:58,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230418372] [2024-11-16 18:37:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230418372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097066123] [2024-11-16 18:37:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:59,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:59,149 INFO L87 Difference]: Start difference. First operand 584 states and 709 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:59,258 INFO L93 Difference]: Finished difference Result 872 states and 1052 transitions. [2024-11-16 18:37:59,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:59,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-16 18:37:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:59,260 INFO L225 Difference]: With dead ends: 872 [2024-11-16 18:37:59,260 INFO L226 Difference]: Without dead ends: 348 [2024-11-16 18:37:59,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:59,261 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 100 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:59,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 526 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-16 18:37:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 280. [2024-11-16 18:37:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 226 states have (on average 1.1194690265486726) internal successors, (253), 228 states have internal predecessors, (253), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 18:37:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 331 transitions. [2024-11-16 18:37:59,297 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 331 transitions. Word has length 134 [2024-11-16 18:37:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:59,297 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 331 transitions. [2024-11-16 18:37:59,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 331 transitions. [2024-11-16 18:37:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 18:37:59,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:37:59,298 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:37:59,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 18:37:59,299 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:37:59,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:37:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash -711229137, now seen corresponding path program 1 times [2024-11-16 18:37:59,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:37:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340394830] [2024-11-16 18:37:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:37:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:37:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:37:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:37:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:37:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:37:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:37:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:37:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:37:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:37:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:37:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:37:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:37:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:37:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:37:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 18:37:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:37:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:37:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:37:59,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:37:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340394830] [2024-11-16 18:37:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340394830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:37:59,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:37:59,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:37:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452472882] [2024-11-16 18:37:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:37:59,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:37:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:37:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:37:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:37:59,444 INFO L87 Difference]: Start difference. First operand 280 states and 331 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:37:59,551 INFO L93 Difference]: Finished difference Result 587 states and 691 transitions. [2024-11-16 18:37:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:37:59,552 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-16 18:37:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:37:59,553 INFO L225 Difference]: With dead ends: 587 [2024-11-16 18:37:59,553 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 18:37:59,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-16 18:37:59,555 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 71 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:37:59,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 490 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:37:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 18:37:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 18:37:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 18:37:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 18:37:59,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2024-11-16 18:37:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:37:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 18:37:59,556 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:37:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 18:37:59,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 18:37:59,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:37:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 18:37:59,562 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] [2024-11-16 18:37:59,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 18:38:03,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:38:03,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base [2024-11-16 18:38:03,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-16 18:38:03,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#11 [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2024-11-16 18:38:03,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset [2024-11-16 18:38:03,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base [2024-11-16 18:38:03,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset [2024-11-16 18:38:03,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base [2024-11-16 18:38:03,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#11 [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base [2024-11-16 18:38:03,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-11-16 18:38:03,112 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-11-16 18:38:03,112 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] [2024-11-16 18:38:03,112 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2024-11-16 18:38:03,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:38:03 BoogieIcfgContainer [2024-11-16 18:38:03,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:38:03,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:38:03,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:38:03,117 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:38:03,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:46" (3/4) ... [2024-11-16 18:38:03,119 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 18:38:03,123 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 18:38:03,129 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 18:38:03,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 18:38:03,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 18:38:03,131 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 18:38:03,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 18:38:03,235 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 18:38:03,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:38:03,235 INFO L158 Benchmark]: Toolchain (without parser) took 17519.11ms. Allocated memory was 167.8MB in the beginning and 589.3MB in the end (delta: 421.5MB). Free memory was 94.2MB in the beginning and 487.6MB in the end (delta: -393.4MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,236 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:38:03,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.53ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 136.6MB in the end (delta: -42.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.65ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 133.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,236 INFO L158 Benchmark]: Boogie Preprocessor took 67.27ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 129.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,239 INFO L158 Benchmark]: IcfgBuilder took 605.86ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 90.5MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,239 INFO L158 Benchmark]: TraceAbstraction took 16396.76ms. Allocated memory was 167.8MB in the beginning and 589.3MB in the end (delta: 421.5MB). Free memory was 89.4MB in the beginning and 497.0MB in the end (delta: -407.6MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,239 INFO L158 Benchmark]: Witness Printer took 118.47ms. Allocated memory is still 589.3MB. Free memory was 497.0MB in the beginning and 487.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 18:38:03,240 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.21ms. Allocated memory is still 167.8MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.53ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 136.6MB in the end (delta: -42.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.65ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 133.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.27ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 129.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 605.86ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 90.5MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16396.76ms. Allocated memory was 167.8MB in the beginning and 589.3MB in the end (delta: 421.5MB). Free memory was 89.4MB in the beginning and 497.0MB in the end (delta: -407.6MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. * Witness Printer took 118.47ms. Allocated memory is still 589.3MB. Free memory was 497.0MB in the beginning and 487.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_11~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_5~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_5_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_11_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2315 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2314 mSDsluCounter, 13180 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9852 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2553 IncrementalHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 3328 mSDtfsCounter, 2553 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1129 GetRequests, 961 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=607occurred in iteration=18, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 456 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2825 NumberOfCodeBlocks, 2825 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2936 ConstructedInterpolants, 0 QuantifiedInterpolants, 8737 SizeOfPredicates, 10 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 9379/9660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((((((((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_1_Pointer == \old(var_1_1_Pointer))) && (var_1_3 == \old(var_1_3))) && (var_1_3_Pointer == \old(var_1_3_Pointer))) && (var_1_4 == \old(var_1_4))) && (var_1_4_Pointer == \old(var_1_4_Pointer))) && (var_1_5 == \old(var_1_5))) && (var_1_5_Pointer == \old(var_1_5_Pointer))) && (var_1_6 == \old(var_1_6))) && (var_1_6_Pointer == \old(var_1_6_Pointer))) && (var_1_7 == \old(var_1_7))) && (var_1_7_Pointer == \old(var_1_7_Pointer))) && (var_1_8 == \old(var_1_8))) && (var_1_8_Pointer == \old(var_1_8_Pointer))) && (var_1_9 == \old(var_1_9))) && (var_1_9_Pointer == \old(var_1_9_Pointer))) && (var_1_10 == \old(var_1_10))) && (var_1_10_Pointer == \old(var_1_10_Pointer))) && (var_1_11 == \old(var_1_11))) && (var_1_11_Pointer == \old(var_1_11_Pointer))) && (var_1_12 == \old(var_1_12))) && (var_1_12_Pointer == \old(var_1_12_Pointer))) && (var_1_13 == \old(var_1_13))) && (var_1_13_Pointer == \old(var_1_13_Pointer))) && (last_1_var_1_8 == \old(last_1_var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-11-16 18:38:03,269 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 Writing output log to file Ultimate.log Result: TRUE