./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-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 dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:19:22,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:19:22,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:19:22,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:19:22,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:19:22,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:19:22,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:19:22,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:19:22,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:19:22,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:19:22,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:19:22,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:19:22,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:19:22,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:19:22,829 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:19:22,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:19:22,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:19:22,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:19:22,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:19:22,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:19:22,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:19:22,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:19:22,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:19:22,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:19:22,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:19:22,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:19:22,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:19:22,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:19:22,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:19:22,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:19:22,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:19:22,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:19:22,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:19:22,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:19:22,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:19:22,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:19:22,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:19:22,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:19:22,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:19:22,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:19:22,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:19:22,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:19:22,838 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 -> dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 [2024-11-10 09:19:23,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:19:23,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:19:23,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:19:23,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:19:23,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:19:23,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2024-11-10 09:19:24,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:19:24,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:19:24,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2024-11-10 09:19:24,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9c3b06f/1e9312e8bd7e49028c2ee6ffbf8d975a/FLAG41a433e1b [2024-11-10 09:19:24,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9c3b06f/1e9312e8bd7e49028c2ee6ffbf8d975a [2024-11-10 09:19:24,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:19:24,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:19:24,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:19:24,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:19:24,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:19:24,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a8a42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24, skipping insertion in model container [2024-11-10 09:19:24,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:19:24,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2024-11-10 09:19:24,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:19:24,645 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:19:24,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2024-11-10 09:19:24,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:19:24,704 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:19:24,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24 WrapperNode [2024-11-10 09:19:24,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:19:24,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:19:24,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:19:24,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:19:24,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,789 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2024-11-10 09:19:24,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:19:24,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:19:24,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:19:24,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:19:24,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,818 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2024-11-10 09:19:24,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:19:24,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:19:24,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:19:24,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:19:24,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (1/1) ... [2024-11-10 09:19:24,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:19:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:19:24,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:19:24,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:19:24,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:19:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:19:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:19:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:19:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:19:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:19:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:19:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:19:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:19:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:19:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:19:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:19:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:19:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:19:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:19:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:19:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:19:24,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:19:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:19:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:19:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:19:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:19:24,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:19:24,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:19:24,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:19:24,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:19:24,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:19:24,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:19:24,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:19:25,043 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:19:25,045 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:19:25,298 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: 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-10 09:19:25,328 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-10 09:19:25,328 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:19:25,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:19:25,344 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:19:25,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:19:25 BoogieIcfgContainer [2024-11-10 09:19:25,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:19:25,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:19:25,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:19:25,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:19:25,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:19:24" (1/3) ... [2024-11-10 09:19:25,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12956c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:19:25, skipping insertion in model container [2024-11-10 09:19:25,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:24" (2/3) ... [2024-11-10 09:19:25,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12956c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:19:25, skipping insertion in model container [2024-11-10 09:19:25,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:19:25" (3/3) ... [2024-11-10 09:19:25,351 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-76.i [2024-11-10 09:19:25,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:19:25,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:19:25,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:19:25,416 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;@605184db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:19:25,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:19:25,420 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-10 09:19:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 09:19:25,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:25,433 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-10 09:19:25,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:25,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1329403439, now seen corresponding path program 1 times [2024-11-10 09:19:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:25,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26198302] [2024-11-10 09:19:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:25,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-10 09:19:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:25,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26198302] [2024-11-10 09:19:25,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26198302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:25,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:25,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:19:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415017659] [2024-11-10 09:19:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:25,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:19:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:19:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:19:25,732 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-10 09:19:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:25,762 INFO L93 Difference]: Finished difference Result 198 states and 306 transitions. [2024-11-10 09:19:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:19:25,765 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-10 09:19:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:25,771 INFO L225 Difference]: With dead ends: 198 [2024-11-10 09:19:25,771 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:19:25,775 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-10 09:19:25,778 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-10 09:19:25,779 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-10 09:19:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:19:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 09:19:25,814 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-10 09:19:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-11-10 09:19:25,817 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 121 [2024-11-10 09:19:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:25,818 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-11-10 09:19:25,818 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-10 09:19:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-11-10 09:19:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 09:19:25,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:25,826 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-10 09:19:25,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:19:25,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:25,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:25,827 INFO L85 PathProgramCache]: Analyzing trace with hash -608247897, now seen corresponding path program 1 times [2024-11-10 09:19:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:25,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763378365] [2024-11-10 09:19:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,147 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-10 09:19:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763378365] [2024-11-10 09:19:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763378365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:26,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:19:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862402130] [2024-11-10 09:19:26,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:19:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:19:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:19:26,153 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-10 09:19:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:26,170 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2024-11-10 09:19:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:19:26,171 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-10 09:19:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:26,172 INFO L225 Difference]: With dead ends: 189 [2024-11-10 09:19:26,172 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:19:26,173 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-10 09:19:26,173 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 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-10 09:19:26,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:19:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:19:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 09:19:26,180 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-10 09:19:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-10 09:19:26,182 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 121 [2024-11-10 09:19:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:26,184 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-10 09:19:26,184 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-10 09:19:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-10 09:19:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 09:19:26,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:26,188 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-10 09:19:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:19:26,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1648607373, now seen corresponding path program 1 times [2024-11-10 09:19:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324473811] [2024-11-10 09:19:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:26,470 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-10 09:19:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324473811] [2024-11-10 09:19:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324473811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:26,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:19:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730971561] [2024-11-10 09:19:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:26,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:19:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:19:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:19:26,474 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10 09:19:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:26,610 INFO L93 Difference]: Finished difference Result 236 states and 330 transitions. [2024-11-10 09:19:26,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:19:26,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 122 [2024-11-10 09:19:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:26,613 INFO L225 Difference]: With dead ends: 236 [2024-11-10 09:19:26,613 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 09:19:26,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:26,615 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 113 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:26,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 384 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 09:19:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 96. [2024-11-10 09:19:26,622 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-10 09:19:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-10 09:19:26,622 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 122 [2024-11-10 09:19:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:26,623 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-10 09:19:26,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10 09:19:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-10 09:19:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 09:19:26,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:26,624 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-10 09:19:26,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:19:26,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:26,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash 608303634, now seen corresponding path program 1 times [2024-11-10 09:19:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801169171] [2024-11-10 09:19:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,517 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-10 09:19:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801169171] [2024-11-10 09:19:27,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801169171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:27,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:27,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:19:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311095898] [2024-11-10 09:19:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:27,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:19:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:19:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:19:27,520 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 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-10 09:19:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:27,757 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2024-11-10 09:19:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:19:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 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 122 [2024-11-10 09:19:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:27,759 INFO L225 Difference]: With dead ends: 244 [2024-11-10 09:19:27,759 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 09:19:27,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:19:27,760 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 189 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:27,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 686 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:19:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 09:19:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 110. [2024-11-10 09:19:27,777 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-10 09:19:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2024-11-10 09:19:27,779 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 122 [2024-11-10 09:19:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:27,781 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2024-11-10 09:19:27,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 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-10 09:19:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-10 09:19:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:19:27,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:27,783 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-10 09:19:27,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:19:27,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 670421332, now seen corresponding path program 1 times [2024-11-10 09:19:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128841293] [2024-11-10 09:19:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:27,954 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-10 09:19:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128841293] [2024-11-10 09:19:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128841293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:19:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057860590] [2024-11-10 09:19:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:27,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:19:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:27,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:19:27,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:27,959 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-10 09:19:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:28,107 INFO L93 Difference]: Finished difference Result 295 states and 402 transitions. [2024-11-10 09:19:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:28,108 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-10 09:19:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:28,109 INFO L225 Difference]: With dead ends: 295 [2024-11-10 09:19:28,109 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 09:19:28,110 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-10 09:19:28,114 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 114 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:28,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 535 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 09:19:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2024-11-10 09:19:28,129 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-10 09:19:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-10 09:19:28,130 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 124 [2024-11-10 09:19:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:28,131 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-10 09:19:28,133 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-10 09:19:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-10 09:19:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 09:19:28,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:28,134 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-10 09:19:28,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:19:28,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash -17299333, now seen corresponding path program 1 times [2024-11-10 09:19:28,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:28,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876548236] [2024-11-10 09:19:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,308 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-10 09:19:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876548236] [2024-11-10 09:19:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876548236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:19:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783845048] [2024-11-10 09:19:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:28,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:19:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:19:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:28,310 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-10 09:19:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:28,335 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2024-11-10 09:19:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:28,336 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-10 09:19:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:28,337 INFO L225 Difference]: With dead ends: 220 [2024-11-10 09:19:28,337 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 09:19:28,337 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-10 09:19:28,338 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-10 09:19:28,341 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-10 09:19:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 09:19:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-10 09:19:28,352 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-10 09:19:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2024-11-10 09:19:28,353 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 124 [2024-11-10 09:19:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2024-11-10 09:19:28,354 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-10 09:19:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2024-11-10 09:19:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 09:19:28,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:28,356 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-10 09:19:28,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:19:28,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:28,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1649107690, now seen corresponding path program 1 times [2024-11-10 09:19:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:28,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266213344] [2024-11-10 09:19:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:28,801 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-10 09:19:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266213344] [2024-11-10 09:19:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266213344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:19:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295488467] [2024-11-10 09:19:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:28,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:19:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:19:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:19:28,803 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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-10 09:19:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:28,980 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2024-11-10 09:19:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:19:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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 126 [2024-11-10 09:19:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:28,981 INFO L225 Difference]: With dead ends: 279 [2024-11-10 09:19:28,982 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 09:19:28,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:19:29,001 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 189 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:29,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 645 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 09:19:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 114. [2024-11-10 09:19:29,016 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-10 09:19:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-11-10 09:19:29,017 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 126 [2024-11-10 09:19:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:29,018 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-11-10 09:19:29,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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-10 09:19:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-11-10 09:19:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 09:19:29,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:29,019 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-10 09:19:29,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:19:29,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash 964410485, now seen corresponding path program 1 times [2024-11-10 09:19:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:29,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522266413] [2024-11-10 09:19:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:29,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,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-10 09:19:29,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522266413] [2024-11-10 09:19:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522266413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:19:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447716567] [2024-11-10 09:19:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:19:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:19:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:19:29,150 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-10 09:19:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:29,183 INFO L93 Difference]: Finished difference Result 229 states and 306 transitions. [2024-11-10 09:19:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:19:29,183 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-10 09:19:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:29,184 INFO L225 Difference]: With dead ends: 229 [2024-11-10 09:19:29,184 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 09:19:29,184 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-10 09:19:29,185 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-10 09:19:29,185 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-10 09:19:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 09:19:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-11-10 09:19:29,191 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-10 09:19:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2024-11-10 09:19:29,192 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 153 transitions. Word has length 126 [2024-11-10 09:19:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:29,192 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 153 transitions. [2024-11-10 09:19:29,192 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-10 09:19:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 153 transitions. [2024-11-10 09:19:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:19:29,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:29,193 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-10 09:19:29,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:19:29,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:29,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1341476648, now seen corresponding path program 1 times [2024-11-10 09:19:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436669388] [2024-11-10 09:19:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:29,401 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-10 09:19:29,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436669388] [2024-11-10 09:19:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436669388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:29,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:19:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686373498] [2024-11-10 09:19:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:19:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:19:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:19:29,403 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-10 09:19:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:29,454 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2024-11-10 09:19:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:29,455 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-10 09:19:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:29,456 INFO L225 Difference]: With dead ends: 236 [2024-11-10 09:19:29,456 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 09:19:29,456 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-10 09:19:29,457 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:29,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 361 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:19:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 09:19:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-11-10 09:19:29,464 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-10 09:19:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2024-11-10 09:19:29,464 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 128 [2024-11-10 09:19:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:29,465 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2024-11-10 09:19:29,465 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-10 09:19:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2024-11-10 09:19:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:19:29,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:29,466 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-10 09:19:29,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:19:29,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:29,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash 166075161, now seen corresponding path program 1 times [2024-11-10 09:19:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113029351] [2024-11-10 09:19:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:29,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,189 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-10 09:19:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113029351] [2024-11-10 09:19:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113029351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:30,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:19:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892169118] [2024-11-10 09:19:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:30,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:19:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:30,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:19:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:19:30,191 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 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-10 09:19:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:30,528 INFO L93 Difference]: Finished difference Result 289 states and 378 transitions. [2024-11-10 09:19:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:19:30,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 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 128 [2024-11-10 09:19:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:30,530 INFO L225 Difference]: With dead ends: 289 [2024-11-10 09:19:30,530 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 09:19:30,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:19:30,531 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 124 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:30,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 897 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:19:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 09:19:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110. [2024-11-10 09:19:30,543 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-10 09:19:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 146 transitions. [2024-11-10 09:19:30,543 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 146 transitions. Word has length 128 [2024-11-10 09:19:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 146 transitions. [2024-11-10 09:19:30,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 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-10 09:19:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 146 transitions. [2024-11-10 09:19:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:19:30,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:30,545 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-10 09:19:30,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:19:30,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:30,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1396240809, now seen corresponding path program 1 times [2024-11-10 09:19:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471092597] [2024-11-10 09:19:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:30,902 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-10 09:19:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471092597] [2024-11-10 09:19:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471092597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:19:30,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868734111] [2024-11-10 09:19:30,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:30,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:19:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:30,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:19:30,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:19:30,904 INFO L87 Difference]: Start difference. First operand 110 states and 146 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-10 09:19:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:31,068 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2024-11-10 09:19:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:19:31,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 128 [2024-11-10 09:19:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:31,070 INFO L225 Difference]: With dead ends: 301 [2024-11-10 09:19:31,070 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 09:19:31,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:19:31,071 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 99 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:31,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 663 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 09:19:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2024-11-10 09:19:31,081 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-10 09:19:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2024-11-10 09:19:31,082 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 128 [2024-11-10 09:19:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:31,084 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2024-11-10 09:19:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-10 09:19:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2024-11-10 09:19:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:19:31,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:31,085 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-10 09:19:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:19:31,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:31,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1058697882, now seen corresponding path program 1 times [2024-11-10 09:19:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434829976] [2024-11-10 09:19:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,204 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-10 09:19:31,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434829976] [2024-11-10 09:19:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434829976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:19:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154350280] [2024-11-10 09:19:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:31,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:19:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:19:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:19:31,207 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-10 09:19:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:31,237 INFO L93 Difference]: Finished difference Result 237 states and 313 transitions. [2024-11-10 09:19:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:19:31,238 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-10 09:19:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:31,239 INFO L225 Difference]: With dead ends: 237 [2024-11-10 09:19:31,239 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 09:19:31,239 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-10 09:19:31,240 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:31,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:19:31,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 09:19:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-10 09:19:31,250 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-10 09:19:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2024-11-10 09:19:31,251 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 128 [2024-11-10 09:19:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:31,253 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2024-11-10 09:19:31,253 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-10 09:19:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2024-11-10 09:19:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 09:19:31,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:31,254 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-10 09:19:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:19:31,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:31,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash -367348640, now seen corresponding path program 1 times [2024-11-10 09:19:31,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137706967] [2024-11-10 09:19:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:31,818 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-10 09:19:31,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137706967] [2024-11-10 09:19:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137706967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:31,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:19:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112106209] [2024-11-10 09:19:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:31,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:19:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:19:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:19:31,821 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 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-10 09:19:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:32,106 INFO L93 Difference]: Finished difference Result 340 states and 441 transitions. [2024-11-10 09:19:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:19:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 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 130 [2024-11-10 09:19:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:32,109 INFO L225 Difference]: With dead ends: 340 [2024-11-10 09:19:32,109 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 09:19:32,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:19:32,110 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 87 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:32,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1037 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:19:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 09:19:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-10 09:19:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 191 states have internal predecessors, (236), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:19:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-11-10 09:19:32,136 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 130 [2024-11-10 09:19:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:32,137 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-11-10 09:19:32,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 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-10 09:19:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-11-10 09:19:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 09:19:32,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:32,139 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-10 09:19:32,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:19:32,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1256665497, now seen corresponding path program 1 times [2024-11-10 09:19:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24700469] [2024-11-10 09:19:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,328 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-10 09:19:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24700469] [2024-11-10 09:19:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24700469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:19:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264779834] [2024-11-10 09:19:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:32,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:19:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:19:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:32,330 INFO L87 Difference]: Start difference. First operand 219 states and 284 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-10 09:19:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:32,430 INFO L93 Difference]: Finished difference Result 442 states and 570 transitions. [2024-11-10 09:19:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:32,431 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-10 09:19:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:32,433 INFO L225 Difference]: With dead ends: 442 [2024-11-10 09:19:32,433 INFO L226 Difference]: Without dead ends: 226 [2024-11-10 09:19:32,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:19:32,434 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 81 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:32,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 608 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-10 09:19:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2024-11-10 09:19:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 193 states have (on average 1.233160621761658) internal successors, (238), 194 states have internal predecessors, (238), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:19:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 286 transitions. [2024-11-10 09:19:32,451 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 286 transitions. Word has length 131 [2024-11-10 09:19:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:32,452 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 286 transitions. [2024-11-10 09:19:32,452 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-10 09:19:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 286 transitions. [2024-11-10 09:19:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:19:32,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:32,453 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-10 09:19:32,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:19:32,454 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:32,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1285703317, now seen corresponding path program 1 times [2024-11-10 09:19:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:32,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683034031] [2024-11-10 09:19:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:32,898 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-10 09:19:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683034031] [2024-11-10 09:19:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683034031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:32,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:32,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:19:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75836144] [2024-11-10 09:19:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:32,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:19:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:32,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:19:32,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:19:32,900 INFO L87 Difference]: Start difference. First operand 223 states and 286 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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-10 09:19:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:33,017 INFO L93 Difference]: Finished difference Result 305 states and 383 transitions. [2024-11-10 09:19:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:19:33,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 132 [2024-11-10 09:19:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:33,019 INFO L225 Difference]: With dead ends: 305 [2024-11-10 09:19:33,019 INFO L226 Difference]: Without dead ends: 302 [2024-11-10 09:19:33,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:19:33,020 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 31 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:33,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 775 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-10 09:19:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 273. [2024-11-10 09:19:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 243 states have (on average 1.213991769547325) internal successors, (295), 244 states have internal predecessors, (295), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:19:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2024-11-10 09:19:33,036 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 132 [2024-11-10 09:19:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:33,037 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2024-11-10 09:19:33,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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-10 09:19:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2024-11-10 09:19:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:19:33,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:33,038 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-10 09:19:33,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:19:33,038 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1556121379, now seen corresponding path program 1 times [2024-11-10 09:19:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:33,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848126860] [2024-11-10 09:19:33,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:33,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,162 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-10 09:19:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848126860] [2024-11-10 09:19:33,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848126860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:33,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:19:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006753098] [2024-11-10 09:19:33,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:33,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:19:33,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:19:33,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:33,164 INFO L87 Difference]: Start difference. First operand 273 states and 343 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-10 09:19:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:33,250 INFO L93 Difference]: Finished difference Result 540 states and 675 transitions. [2024-11-10 09:19:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:33,251 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-10 09:19:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:33,252 INFO L225 Difference]: With dead ends: 540 [2024-11-10 09:19:33,252 INFO L226 Difference]: Without dead ends: 270 [2024-11-10 09:19:33,252 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-10 09:19:33,253 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 75 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:33,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 559 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-10 09:19:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2024-11-10 09:19:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.1991525423728813) internal successors, (283), 237 states have internal predecessors, (283), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:19:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 331 transitions. [2024-11-10 09:19:33,270 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 331 transitions. Word has length 132 [2024-11-10 09:19:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:33,270 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 331 transitions. [2024-11-10 09:19:33,270 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-10 09:19:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 331 transitions. [2024-11-10 09:19:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:19:33,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:33,271 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-10 09:19:33,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:19:33,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash 48335830, now seen corresponding path program 1 times [2024-11-10 09:19:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080746190] [2024-11-10 09:19:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,459 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-10 09:19:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080746190] [2024-11-10 09:19:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080746190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:33,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:19:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265043502] [2024-11-10 09:19:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:33,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:19:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:33,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:19:33,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:19:33,461 INFO L87 Difference]: Start difference. First operand 267 states and 331 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-10 09:19:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:33,590 INFO L93 Difference]: Finished difference Result 657 states and 814 transitions. [2024-11-10 09:19:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:19:33,591 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-10 09:19:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:33,593 INFO L225 Difference]: With dead ends: 657 [2024-11-10 09:19:33,593 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 09:19:33,593 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-10 09:19:33,594 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 73 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:33,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1296 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 09:19:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2024-11-10 09:19:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 351 states have (on average 1.1994301994301995) internal successors, (421), 353 states have internal predecessors, (421), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 09:19:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2024-11-10 09:19:33,616 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 133 [2024-11-10 09:19:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:33,616 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2024-11-10 09:19:33,617 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-10 09:19:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2024-11-10 09:19:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:19:33,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:33,618 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-10 09:19:33,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:19:33,618 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:33,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash 741437527, now seen corresponding path program 1 times [2024-11-10 09:19:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:33,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36619345] [2024-11-10 09:19:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:33,769 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-10 09:19:33,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36619345] [2024-11-10 09:19:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36619345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:19:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640264370] [2024-11-10 09:19:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:33,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:19:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:19:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:33,771 INFO L87 Difference]: Start difference. First operand 389 states and 479 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-10 09:19:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:33,879 INFO L93 Difference]: Finished difference Result 942 states and 1167 transitions. [2024-11-10 09:19:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:33,880 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-10 09:19:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:33,884 INFO L225 Difference]: With dead ends: 942 [2024-11-10 09:19:33,884 INFO L226 Difference]: Without dead ends: 556 [2024-11-10 09:19:33,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:19:33,885 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 84 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:33,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 563 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-10 09:19:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 390. [2024-11-10 09:19:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 352 states have (on average 1.1903409090909092) internal successors, (419), 354 states have internal predecessors, (419), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 09:19:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 477 transitions. [2024-11-10 09:19:33,919 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 477 transitions. Word has length 133 [2024-11-10 09:19:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:33,920 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 477 transitions. [2024-11-10 09:19:33,921 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-10 09:19:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 477 transitions. [2024-11-10 09:19:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 09:19:33,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:33,922 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-10 09:19:33,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:19:33,922 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash -413528546, now seen corresponding path program 1 times [2024-11-10 09:19:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298165644] [2024-11-10 09:19:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 09:19:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298165644] [2024-11-10 09:19:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298165644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:19:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009856390] [2024-11-10 09:19:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:19:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:19:34,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:19:34,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:19:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:34,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:19:34,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:19:34,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-10 09:19:34,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:19:34,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2024-11-10 09:19:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-10 09:19:34,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:19:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 09:19:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009856390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:19:34,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:19:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-10 09:19:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066624189] [2024-11-10 09:19:34,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:19:34,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:19:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:19:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:19:34,919 INFO L87 Difference]: Start difference. First operand 390 states and 477 transitions. Second operand has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-10 09:19:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:35,504 INFO L93 Difference]: Finished difference Result 703 states and 853 transitions. [2024-11-10 09:19:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 09:19:35,508 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 134 [2024-11-10 09:19:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:35,510 INFO L225 Difference]: With dead ends: 703 [2024-11-10 09:19:35,510 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 09:19:35,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2024-11-10 09:19:35,512 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 238 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:35,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 684 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:19:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 09:19:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 248. [2024-11-10 09:19:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 207 states have (on average 1.1256038647342994) internal successors, (233), 209 states have internal predecessors, (233), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 09:19:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 291 transitions. [2024-11-10 09:19:35,538 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 291 transitions. Word has length 134 [2024-11-10 09:19:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:35,538 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 291 transitions. [2024-11-10 09:19:35,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-10 09:19:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 291 transitions. [2024-11-10 09:19:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:19:35,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:19:35,539 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-10 09:19:35,559 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-10 09:19:35,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:19:35,741 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:19:35,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:19:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash 194832771, now seen corresponding path program 1 times [2024-11-10 09:19:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:19:35,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489828083] [2024-11-10 09:19:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:19:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:19:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:19:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:19:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:19:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:19:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:19:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:19:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:19:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:19:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:19:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:19:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:19:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:19:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:19:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:19:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:19:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:19:35,900 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-10 09:19:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:19:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489828083] [2024-11-10 09:19:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489828083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:19:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:19:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:19:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620691417] [2024-11-10 09:19:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:19:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:19:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:19:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:19:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:19:35,902 INFO L87 Difference]: Start difference. First operand 248 states and 291 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-10 09:19:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:19:36,003 INFO L93 Difference]: Finished difference Result 519 states and 608 transitions. [2024-11-10 09:19:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:19:36,003 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-10 09:19:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:19:36,004 INFO L225 Difference]: With dead ends: 519 [2024-11-10 09:19:36,004 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 09:19:36,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:19:36,005 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 106 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:19:36,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 368 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:19:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 09:19:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 09:19:36,006 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-10 09:19:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 09:19:36,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2024-11-10 09:19:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:19:36,006 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 09:19:36,007 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-10 09:19:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 09:19:36,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 09:19:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:19:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:19:36,012 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] [2024-11-10 09:19:36,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 09:19:39,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:19:39,024 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 09:19:39,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,036 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,036 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,037 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 09:19:39,037 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 09:19:39,037 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,037 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-10 09:19:39,037 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-10 09:19:39,037 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-10 09:19:39,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:19:39 BoogieIcfgContainer [2024-11-10 09:19:39,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:19:39,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:19:39,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:19:39,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:19:39,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:19:25" (3/4) ... [2024-11-10 09:19:39,043 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 09:19:39,046 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 09:19:39,052 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 09:19:39,052 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 09:19:39,053 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 09:19:39,053 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 09:19:39,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 09:19:39,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 09:19:39,161 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:19:39,162 INFO L158 Benchmark]: Toolchain (without parser) took 14734.52ms. Allocated memory was 176.2MB in the beginning and 608.2MB in the end (delta: 432.0MB). Free memory was 107.8MB in the beginning and 517.8MB in the end (delta: -410.0MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,162 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:19:39,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.80ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 91.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.31ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 147.2MB in the end (delta: -56.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,162 INFO L158 Benchmark]: Boogie Preprocessor took 48.84ms. Allocated memory is still 176.2MB. Free memory was 147.2MB in the beginning and 143.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,163 INFO L158 Benchmark]: IcfgBuilder took 502.42ms. Allocated memory is still 176.2MB. Free memory was 142.4MB in the beginning and 110.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,163 INFO L158 Benchmark]: TraceAbstraction took 13694.41ms. Allocated memory was 176.2MB in the beginning and 608.2MB in the end (delta: 432.0MB). Free memory was 110.2MB in the beginning and 527.3MB in the end (delta: -417.0MB). Peak memory consumption was 336.5MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,163 INFO L158 Benchmark]: Witness Printer took 120.19ms. Allocated memory is still 608.2MB. Free memory was 527.3MB in the beginning and 517.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 09:19:39,164 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.80ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 91.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.31ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 147.2MB in the end (delta: -56.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.84ms. Allocated memory is still 176.2MB. Free memory was 147.2MB in the beginning and 143.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 502.42ms. Allocated memory is still 176.2MB. Free memory was 142.4MB in the beginning and 110.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13694.41ms. Allocated memory was 176.2MB in the beginning and 608.2MB in the end (delta: 432.0MB). Free memory was 110.2MB in the beginning and 527.3MB in the end (delta: -417.0MB). Peak memory consumption was 336.5MB. Max. memory is 16.1GB. * Witness Printer took 120.19ms. Allocated memory is still 608.2MB. Free memory was 527.3MB in the beginning and 517.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - 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[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - 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[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] * 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: 10.6s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1617 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1605 mSDsluCounter, 11951 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8901 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2513 IncrementalHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 3050 mSDtfsCounter, 2513 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1068 GetRequests, 937 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=18, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 645 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2692 NumberOfCodeBlocks, 2692 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2804 ConstructedInterpolants, 0 QuantifiedInterpolants, 8708 SizeOfPredicates, 4 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 9141/9240 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: 109]: 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)) && (BOOL_unsigned_char_Array_0 == \old(BOOL_unsigned_char_Array_0))) && (double_Array_0 == \old(double_Array_0))) && (signed_char_Array_0 == \old(signed_char_Array_0))) && (signed_long_int_Array_0 == \old(signed_long_int_Array_0))) && (unsigned_char_Array_0 == \old(unsigned_char_Array_0))) && (last_1_signed_char_Array_0_1__0_ == \old(last_1_signed_char_Array_0_1__0_)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 09:19:39,190 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