./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:39:26,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:39:26,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:39:26,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:39:26,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:39:26,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:39:26,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:39:26,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:39:26,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:39:26,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:39:26,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:39:26,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:39:26,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:39:26,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:39:26,752 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:39:26,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:39:26,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:39:26,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:39:26,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:39:26,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:39:26,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:39:26,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:39:26,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:39:26,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:39:26,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:39:26,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:39:26,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:39:26,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:39:26,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:39:26,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:39:26,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:39:26,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:39:26,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:39:26,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:39:26,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:39:26,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:39:26,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:39:26,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:39:26,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:39:26,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:39:26,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:39:26,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:39:26,758 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-clean/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-clean/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 -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2024-10-11 13:39:26,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:39:26,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:39:26,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:39:26,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:39:26,963 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:39:26,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-10-11 13:39:28,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:39:28,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:39:28,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-10-11 13:39:28,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b263d580f/338dffd134dc417490fc7c923bf7dc28/FLAGc5889433b [2024-10-11 13:39:28,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b263d580f/338dffd134dc417490fc7c923bf7dc28 [2024-10-11 13:39:28,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:39:28,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:39:28,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:39:28,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:39:28,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:39:28,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dc5dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28, skipping insertion in model container [2024-10-11 13:39:28,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:39:28,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-10-11 13:39:28,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:39:28,587 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:39:28,598 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-10-11 13:39:28,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:39:28,646 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:39:28,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28 WrapperNode [2024-10-11 13:39:28,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:39:28,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:39:28,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:39:28,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:39:28,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,694 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2024-10-11 13:39:28,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:39:28,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:39:28,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:39:28,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:39:28,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,723 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-10-11 13:39:28,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:39:28,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:39:28,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:39:28,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:39:28,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (1/1) ... [2024-10-11 13:39:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:39:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:39:28,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:39:28,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:39:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:39:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:39:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:39:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:39:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:39:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:39:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:39:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:39:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:39:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:39:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:39:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:39:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:39:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:39:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:39:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:39:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:39:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:39:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:39:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:39:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:39:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:39:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:39:28,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:39:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:39:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:39:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:39:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:39:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:39:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:39:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:39:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:39:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:39:28,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:39:29,022 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:39:29,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:39:29,460 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-11 13:39:29,460 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:39:29,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:39:29,494 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:39:29,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:29 BoogieIcfgContainer [2024-10-11 13:39:29,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:39:29,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:39:29,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:39:29,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:39:29,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:39:28" (1/3) ... [2024-10-11 13:39:29,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14715bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:29, skipping insertion in model container [2024-10-11 13:39:29,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:28" (2/3) ... [2024-10-11 13:39:29,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14715bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:29, skipping insertion in model container [2024-10-11 13:39:29,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:29" (3/3) ... [2024-10-11 13:39:29,503 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2024-10-11 13:39:29,516 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:39:29,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:39:29,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:39:29,569 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;@30cec81e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:39:29,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:39:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:39:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:39:29,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:29,584 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:29,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:29,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1079870598, now seen corresponding path program 1 times [2024-10-11 13:39:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139224728] [2024-10-11 13:39:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139224728] [2024-10-11 13:39:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139224728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:39:29,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846725932] [2024-10-11 13:39:29,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:39:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:39:30,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:39:30,013 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:39:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:30,046 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2024-10-11 13:39:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:39:30,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2024-10-11 13:39:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:30,053 INFO L225 Difference]: With dead ends: 207 [2024-10-11 13:39:30,054 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 13:39:30,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-10-11 13:39:30,058 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 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-10-11 13:39:30,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:39:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 13:39:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 13:39:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:39:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-11 13:39:30,094 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2024-10-11 13:39:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-11 13:39:30,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:39:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-11 13:39:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:39:30,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:30,099 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:30,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:39:30,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -148898342, now seen corresponding path program 1 times [2024-10-11 13:39:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058985958] [2024-10-11 13:39:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058985958] [2024-10-11 13:39:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058985958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:30,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:39:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110870294] [2024-10-11 13:39:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:39:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:39:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:39:30,586 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:30,622 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2024-10-11 13:39:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:39:30,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-10-11 13:39:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:30,624 INFO L225 Difference]: With dead ends: 205 [2024-10-11 13:39:30,624 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 13:39:30,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-10-11 13:39:30,626 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:30,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:39:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 13:39:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 13:39:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:39:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-11 13:39:30,644 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 135 [2024-10-11 13:39:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-11 13:39:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-11 13:39:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:39:30,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:30,650 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:30,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:39:30,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:30,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1428762020, now seen corresponding path program 1 times [2024-10-11 13:39:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086667014] [2024-10-11 13:39:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086667014] [2024-10-11 13:39:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086667014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:39:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878506749] [2024-10-11 13:39:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:31,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:39:31,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:39:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:39:31,460 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 13:39:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:31,680 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2024-10-11 13:39:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:31,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2024-10-11 13:39:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:31,682 INFO L225 Difference]: With dead ends: 211 [2024-10-11 13:39:31,682 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 13:39:31,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:39:31,683 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 320 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:31,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 519 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:39:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 13:39:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 13:39:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:39:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-11 13:39:31,699 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 135 [2024-10-11 13:39:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-11 13:39:31,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 13:39:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-11 13:39:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:39:31,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:31,704 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:31,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:39:31,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:31,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1821789030, now seen corresponding path program 1 times [2024-10-11 13:39:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:31,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126354788] [2024-10-11 13:39:31,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126354788] [2024-10-11 13:39:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126354788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159669242] [2024-10-11 13:39:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:32,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:32,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:32,577 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:32,745 INFO L93 Difference]: Finished difference Result 324 states and 458 transitions. [2024-10-11 13:39:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:39:32,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-10-11 13:39:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:32,749 INFO L225 Difference]: With dead ends: 324 [2024-10-11 13:39:32,749 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 13:39:32,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:39:32,750 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 94 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:32,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 562 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 13:39:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2024-10-11 13:39:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 170 states have internal predecessors, (228), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:39:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2024-10-11 13:39:32,782 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 135 [2024-10-11 13:39:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:32,784 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2024-10-11 13:39:32,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2024-10-11 13:39:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:39:32,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:32,785 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:39:32,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:32,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash 668833267, now seen corresponding path program 1 times [2024-10-11 13:39:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:32,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974110292] [2024-10-11 13:39:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974110292] [2024-10-11 13:39:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974110292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:34,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 13:39:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361091135] [2024-10-11 13:39:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:39:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:39:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:39:34,604 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 13:39:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:35,255 INFO L93 Difference]: Finished difference Result 318 states and 451 transitions. [2024-10-11 13:39:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:39:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 137 [2024-10-11 13:39:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:35,259 INFO L225 Difference]: With dead ends: 318 [2024-10-11 13:39:35,259 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 13:39:35,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:39:35,263 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 611 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:35,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 787 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:39:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 13:39:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 107. [2024-10-11 13:39:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:39:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-10-11 13:39:35,282 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 137 [2024-10-11 13:39:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:35,283 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-10-11 13:39:35,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 13:39:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-10-11 13:39:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:39:35,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:35,285 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:35,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:39:35,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:35,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1993440470, now seen corresponding path program 1 times [2024-10-11 13:39:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:35,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834185539] [2024-10-11 13:39:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:35,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:35,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:35,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834185539] [2024-10-11 13:39:35,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834185539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:35,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:35,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:39:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719312561] [2024-10-11 13:39:35,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:35,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:39:35,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:35,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:39:35,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:39:35,557 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:35,592 INFO L93 Difference]: Finished difference Result 213 states and 299 transitions. [2024-10-11 13:39:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:39:35,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:39:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:35,594 INFO L225 Difference]: With dead ends: 213 [2024-10-11 13:39:35,594 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 13:39:35,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-10-11 13:39:35,595 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 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-10-11 13:39:35,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:39:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 13:39:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 13:39:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:39:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-10-11 13:39:35,610 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 140 [2024-10-11 13:39:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:35,610 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-10-11 13:39:35,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-10-11 13:39:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:39:35,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:35,612 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:35,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:39:35,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1735275032, now seen corresponding path program 1 times [2024-10-11 13:39:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110800484] [2024-10-11 13:39:35,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:36,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:36,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110800484] [2024-10-11 13:39:36,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110800484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:36,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:36,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128126131] [2024-10-11 13:39:36,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:36,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:36,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:36,083 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:36,187 INFO L93 Difference]: Finished difference Result 289 states and 399 transitions. [2024-10-11 13:39:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:39:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:39:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:36,189 INFO L225 Difference]: With dead ends: 289 [2024-10-11 13:39:36,189 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 13:39:36,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:39:36,190 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 90 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:36,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 897 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 13:39:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-10-11 13:39:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 13:39:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2024-10-11 13:39:36,210 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 140 [2024-10-11 13:39:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2024-10-11 13:39:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2024-10-11 13:39:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:39:36,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:36,212 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:39:36,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash -292630820, now seen corresponding path program 1 times [2024-10-11 13:39:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952217304] [2024-10-11 13:39:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:37,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952217304] [2024-10-11 13:39:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952217304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:37,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:39:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075252354] [2024-10-11 13:39:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:37,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:39:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:39:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:39:37,293 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:39:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:37,928 INFO L93 Difference]: Finished difference Result 588 states and 810 transitions. [2024-10-11 13:39:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:39:37,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2024-10-11 13:39:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:37,932 INFO L225 Difference]: With dead ends: 588 [2024-10-11 13:39:37,932 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 13:39:37,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:39:37,934 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 226 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:37,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1479 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:39:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 13:39:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 402. [2024-10-11 13:39:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 334 states have (on average 1.3203592814371257) internal successors, (441), 337 states have internal predecessors, (441), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:39:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 557 transitions. [2024-10-11 13:39:37,969 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 557 transitions. Word has length 141 [2024-10-11 13:39:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:37,969 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 557 transitions. [2024-10-11 13:39:37,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:39:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 557 transitions. [2024-10-11 13:39:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:39:37,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:37,970 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:37,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:39:37,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:37,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash -685657830, now seen corresponding path program 1 times [2024-10-11 13:39:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384660946] [2024-10-11 13:39:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:37,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:38,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384660946] [2024-10-11 13:39:38,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384660946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:38,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869194805] [2024-10-11 13:39:38,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:38,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:38,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:38,299 INFO L87 Difference]: Start difference. First operand 402 states and 557 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:38,399 INFO L93 Difference]: Finished difference Result 915 states and 1264 transitions. [2024-10-11 13:39:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:39:38,400 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-11 13:39:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:38,402 INFO L225 Difference]: With dead ends: 915 [2024-10-11 13:39:38,402 INFO L226 Difference]: Without dead ends: 514 [2024-10-11 13:39:38,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:39:38,405 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 48 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:38,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 699 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-11 13:39:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 428. [2024-10-11 13:39:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.3055555555555556) internal successors, (470), 363 states have internal predecessors, (470), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:39:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 586 transitions. [2024-10-11 13:39:38,445 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 586 transitions. Word has length 141 [2024-10-11 13:39:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:38,445 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 586 transitions. [2024-10-11 13:39:38,445 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 586 transitions. [2024-10-11 13:39:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:39:38,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:38,447 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:38,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:39:38,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:38,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1981574562, now seen corresponding path program 1 times [2024-10-11 13:39:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262602090] [2024-10-11 13:39:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262602090] [2024-10-11 13:39:38,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262602090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595648331] [2024-10-11 13:39:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:38,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:38,773 INFO L87 Difference]: Start difference. First operand 428 states and 586 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:38,911 INFO L93 Difference]: Finished difference Result 941 states and 1289 transitions. [2024-10-11 13:39:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:39:38,911 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-11 13:39:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:38,916 INFO L225 Difference]: With dead ends: 941 [2024-10-11 13:39:38,916 INFO L226 Difference]: Without dead ends: 514 [2024-10-11 13:39:38,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:39:38,917 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 48 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:38,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 790 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-11 13:39:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 428. [2024-10-11 13:39:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.2944444444444445) internal successors, (466), 363 states have internal predecessors, (466), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:39:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 582 transitions. [2024-10-11 13:39:38,969 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 582 transitions. Word has length 141 [2024-10-11 13:39:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:38,969 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 582 transitions. [2024-10-11 13:39:38,969 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 582 transitions. [2024-10-11 13:39:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:39:38,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:38,971 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:38,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:39:38,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:38,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1920365724, now seen corresponding path program 1 times [2024-10-11 13:39:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559933517] [2024-10-11 13:39:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559933517] [2024-10-11 13:39:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559933517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:39,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:39:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311963191] [2024-10-11 13:39:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:39,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:39:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:39:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:39:39,606 INFO L87 Difference]: Start difference. First operand 428 states and 582 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:39,943 INFO L93 Difference]: Finished difference Result 862 states and 1168 transitions. [2024-10-11 13:39:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:39:39,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-11 13:39:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:39,945 INFO L225 Difference]: With dead ends: 862 [2024-10-11 13:39:39,945 INFO L226 Difference]: Without dead ends: 435 [2024-10-11 13:39:39,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:39:39,947 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 143 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:39,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1268 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:39:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-11 13:39:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 428. [2024-10-11 13:39:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.2916666666666667) internal successors, (465), 363 states have internal predecessors, (465), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:39:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 581 transitions. [2024-10-11 13:39:39,983 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 581 transitions. Word has length 141 [2024-10-11 13:39:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:39,984 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 581 transitions. [2024-10-11 13:39:39,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 581 transitions. [2024-10-11 13:39:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:39:39,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:39,985 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:39,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:39:39,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:39,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash -733823082, now seen corresponding path program 1 times [2024-10-11 13:39:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767582169] [2024-10-11 13:39:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:40,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:40,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767582169] [2024-10-11 13:39:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767582169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:40,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:39:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342522346] [2024-10-11 13:39:40,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:39:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:39:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:39:40,148 INFO L87 Difference]: Start difference. First operand 428 states and 581 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:40,200 INFO L93 Difference]: Finished difference Result 870 states and 1181 transitions. [2024-10-11 13:39:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:39:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 13:39:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:40,203 INFO L225 Difference]: With dead ends: 870 [2024-10-11 13:39:40,203 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 13:39:40,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-10-11 13:39:40,205 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:40,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:39:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 13:39:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-10-11 13:39:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 375 states have (on average 1.28) internal successors, (480), 378 states have internal predecessors, (480), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:39:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 596 transitions. [2024-10-11 13:39:40,237 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 596 transitions. Word has length 142 [2024-10-11 13:39:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:40,238 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 596 transitions. [2024-10-11 13:39:40,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 596 transitions. [2024-10-11 13:39:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:39:40,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:40,239 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:39:40,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:40,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 408792204, now seen corresponding path program 1 times [2024-10-11 13:39:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622258000] [2024-10-11 13:39:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:40,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622258000] [2024-10-11 13:39:40,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622258000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:40,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:40,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:40,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086881654] [2024-10-11 13:39:40,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:40,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:40,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:40,414 INFO L87 Difference]: Start difference. First operand 443 states and 596 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:40,484 INFO L93 Difference]: Finished difference Result 905 states and 1216 transitions. [2024-10-11 13:39:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:39:40,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 13:39:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:40,488 INFO L225 Difference]: With dead ends: 905 [2024-10-11 13:39:40,488 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 13:39:40,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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-10-11 13:39:40,490 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:40,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:39:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 13:39:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 457. [2024-10-11 13:39:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 389 states have (on average 1.2699228791773778) internal successors, (494), 392 states have internal predecessors, (494), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:39:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 610 transitions. [2024-10-11 13:39:40,525 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 610 transitions. Word has length 142 [2024-10-11 13:39:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:40,525 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 610 transitions. [2024-10-11 13:39:40,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2024-10-11 13:39:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:39:40,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:40,527 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:39:40,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:40,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash -555710091, now seen corresponding path program 1 times [2024-10-11 13:39:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012101747] [2024-10-11 13:39:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012101747] [2024-10-11 13:39:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012101747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:41,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:41,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:39:41,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008567053] [2024-10-11 13:39:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:41,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:39:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:41,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:39:41,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:39:41,633 INFO L87 Difference]: Start difference. First operand 457 states and 610 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:39:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:42,671 INFO L93 Difference]: Finished difference Result 711 states and 946 transitions. [2024-10-11 13:39:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:39:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2024-10-11 13:39:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:42,674 INFO L225 Difference]: With dead ends: 711 [2024-10-11 13:39:42,674 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 13:39:42,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:39:42,675 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 295 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:42,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1365 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:39:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 13:39:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2024-10-11 13:39:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 426 states have (on average 1.2699530516431925) internal successors, (541), 430 states have internal predecessors, (541), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:39:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2024-10-11 13:39:42,705 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 143 [2024-10-11 13:39:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:42,706 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2024-10-11 13:39:42,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:39:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2024-10-11 13:39:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:39:42,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:42,708 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:42,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:39:42,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1657286453, now seen corresponding path program 1 times [2024-10-11 13:39:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850501897] [2024-10-11 13:39:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:43,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850501897] [2024-10-11 13:39:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850501897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:39:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147110507] [2024-10-11 13:39:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:39:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:39:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:39:43,175 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:43,395 INFO L93 Difference]: Finished difference Result 750 states and 995 transitions. [2024-10-11 13:39:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:39:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-11 13:39:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:43,397 INFO L225 Difference]: With dead ends: 750 [2024-10-11 13:39:43,397 INFO L226 Difference]: Without dead ends: 500 [2024-10-11 13:39:43,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:39:43,398 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 50 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:43,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1162 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-11 13:39:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 251. [2024-10-11 13:39:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.2651162790697674) internal successors, (272), 217 states have internal predecessors, (272), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:39:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2024-10-11 13:39:43,418 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 143 [2024-10-11 13:39:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:43,418 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2024-10-11 13:39:43,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2024-10-11 13:39:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:39:43,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:43,419 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:43,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:39:43,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:43,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1444241647, now seen corresponding path program 1 times [2024-10-11 13:39:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856172125] [2024-10-11 13:39:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:43,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856172125] [2024-10-11 13:39:43,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856172125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:43,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:39:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109333175] [2024-10-11 13:39:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:39:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:43,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:39:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:39:43,715 INFO L87 Difference]: Start difference. First operand 251 states and 332 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:43,815 INFO L93 Difference]: Finished difference Result 664 states and 872 transitions. [2024-10-11 13:39:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:39:43,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:39:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:43,818 INFO L225 Difference]: With dead ends: 664 [2024-10-11 13:39:43,819 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 13:39:43,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-10-11 13:39:43,821 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 56 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:43,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 536 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 13:39:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 353. [2024-10-11 13:39:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.2707006369426752) internal successors, (399), 317 states have internal predecessors, (399), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:39:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2024-10-11 13:39:43,842 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 144 [2024-10-11 13:39:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:43,843 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2024-10-11 13:39:43,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2024-10-11 13:39:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:39:43,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:43,844 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:43,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:39:43,844 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:43,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1355038757, now seen corresponding path program 1 times [2024-10-11 13:39:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697639837] [2024-10-11 13:39:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697639837] [2024-10-11 13:39:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697639837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:44,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:44,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417362106] [2024-10-11 13:39:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:44,412 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:44,532 INFO L93 Difference]: Finished difference Result 692 states and 902 transitions. [2024-10-11 13:39:44,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:39:44,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:39:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:44,535 INFO L225 Difference]: With dead ends: 692 [2024-10-11 13:39:44,535 INFO L226 Difference]: Without dead ends: 690 [2024-10-11 13:39:44,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:39:44,535 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 93 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:44,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 851 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:39:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-11 13:39:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 518. [2024-10-11 13:39:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 479 states have (on average 1.2713987473903967) internal successors, (609), 482 states have internal predecessors, (609), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:39:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 673 transitions. [2024-10-11 13:39:44,580 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 673 transitions. Word has length 144 [2024-10-11 13:39:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:44,580 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 673 transitions. [2024-10-11 13:39:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 673 transitions. [2024-10-11 13:39:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:39:44,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:44,582 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:39:44,582 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:44,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash 815036033, now seen corresponding path program 1 times [2024-10-11 13:39:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899485855] [2024-10-11 13:39:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899485855] [2024-10-11 13:39:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899485855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:39:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219387749] [2024-10-11 13:39:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:44,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:39:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:39:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:39:44,732 INFO L87 Difference]: Start difference. First operand 518 states and 673 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:44,793 INFO L93 Difference]: Finished difference Result 1087 states and 1405 transitions. [2024-10-11 13:39:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:39:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:44,796 INFO L225 Difference]: With dead ends: 1087 [2024-10-11 13:39:44,796 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 13:39:44,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:39:44,797 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:44,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 821 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:39:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 13:39:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 526. [2024-10-11 13:39:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 487 states have (on average 1.26694045174538) internal successors, (617), 490 states have internal predecessors, (617), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:39:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 681 transitions. [2024-10-11 13:39:44,822 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 681 transitions. Word has length 144 [2024-10-11 13:39:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:44,823 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 681 transitions. [2024-10-11 13:39:44,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 681 transitions. [2024-10-11 13:39:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 13:39:44,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:44,824 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:44,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:39:44,824 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:44,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 726762273, now seen corresponding path program 1 times [2024-10-11 13:39:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691421539] [2024-10-11 13:39:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 13:39:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691421539] [2024-10-11 13:39:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691421539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:39:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143632471] [2024-10-11 13:39:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:45,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:39:45,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:39:45,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:39:45,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:39:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:45,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 13:39:45,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:45,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 13:39:46,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:39:46,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 13:39:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 430 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-11 13:39:46,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:39:47,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 13:39:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143632471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:39:47,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:39:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2024-10-11 13:39:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311791389] [2024-10-11 13:39:47,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:39:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 13:39:47,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 13:39:47,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1481, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 13:39:47,568 INFO L87 Difference]: Start difference. First operand 526 states and 681 transitions. Second operand has 28 states, 25 states have (on average 4.76) internal successors, (119), 24 states have internal predecessors, (119), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2024-10-11 13:39:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:48,690 INFO L93 Difference]: Finished difference Result 1058 states and 1365 transitions. [2024-10-11 13:39:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 13:39:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.76) internal successors, (119), 24 states have internal predecessors, (119), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) Word has length 146 [2024-10-11 13:39:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:48,693 INFO L225 Difference]: With dead ends: 1058 [2024-10-11 13:39:48,693 INFO L226 Difference]: Without dead ends: 533 [2024-10-11 13:39:48,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=764, Invalid=2896, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 13:39:48,695 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 764 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:48,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1181 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:39:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-10-11 13:39:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 514. [2024-10-11 13:39:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 471 states have (on average 1.267515923566879) internal successors, (597), 474 states have internal predecessors, (597), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:39:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 661 transitions. [2024-10-11 13:39:48,740 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 661 transitions. Word has length 146 [2024-10-11 13:39:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:48,740 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 661 transitions. [2024-10-11 13:39:48,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.76) internal successors, (119), 24 states have internal predecessors, (119), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2024-10-11 13:39:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 661 transitions. [2024-10-11 13:39:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 13:39:48,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:48,742 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:48,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:39:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:39:48,943 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -428319587, now seen corresponding path program 1 times [2024-10-11 13:39:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331206620] [2024-10-11 13:39:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 13:39:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331206620] [2024-10-11 13:39:49,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331206620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:39:49,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855395237] [2024-10-11 13:39:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:49,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:39:49,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:39:49,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:39:49,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:39:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:50,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 13:39:50,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:50,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:39:50,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:39:50,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:39:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-11 13:39:51,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:39:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:39:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 431 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:39:51,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:39:51,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-11 13:39:51,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 13:39:51,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-10-11 13:39:52,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 13:39:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-11 13:39:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855395237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:39:52,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:39:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 46 [2024-10-11 13:39:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165125932] [2024-10-11 13:39:52,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:39:52,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-11 13:39:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:52,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-11 13:39:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1756, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 13:39:52,183 INFO L87 Difference]: Start difference. First operand 514 states and 661 transitions. Second operand has 46 states, 41 states have (on average 4.2926829268292686) internal successors, (176), 44 states have internal predecessors, (176), 13 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 8 states have call predecessors, (54), 13 states have call successors, (54) [2024-10-11 13:39:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:54,460 INFO L93 Difference]: Finished difference Result 1468 states and 1858 transitions. [2024-10-11 13:39:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 13:39:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 4.2926829268292686) internal successors, (176), 44 states have internal predecessors, (176), 13 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 8 states have call predecessors, (54), 13 states have call successors, (54) Word has length 146 [2024-10-11 13:39:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:54,465 INFO L225 Difference]: With dead ends: 1468 [2024-10-11 13:39:54,465 INFO L226 Difference]: Without dead ends: 955 [2024-10-11 13:39:54,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1488, Invalid=6702, Unknown=0, NotChecked=0, Total=8190 [2024-10-11 13:39:54,468 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1896 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:54,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 2178 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:39:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-11 13:39:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 676. [2024-10-11 13:39:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 595 states have (on average 1.253781512605042) internal successors, (746), 597 states have internal predecessors, (746), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:39:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 858 transitions. [2024-10-11 13:39:54,525 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 858 transitions. Word has length 146 [2024-10-11 13:39:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:54,525 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 858 transitions. [2024-10-11 13:39:54,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 4.2926829268292686) internal successors, (176), 44 states have internal predecessors, (176), 13 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 8 states have call predecessors, (54), 13 states have call successors, (54) [2024-10-11 13:39:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 858 transitions. [2024-10-11 13:39:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 13:39:54,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:54,527 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:54,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:39:54,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:39:54,728 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:54,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 381697767, now seen corresponding path program 1 times [2024-10-11 13:39:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:54,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932982791] [2024-10-11 13:39:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 13:39:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932982791] [2024-10-11 13:39:55,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932982791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:39:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129124454] [2024-10-11 13:39:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:55,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:39:55,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:39:55,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:39:55,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:39:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:55,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 13:39:55,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:55,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:39:55,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:39:56,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:39:56,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 13:39:56,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 13:39:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 431 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:39:56,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:39:56,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-11 13:39:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-10-11 13:39:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129124454] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:39:56,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:39:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 33 [2024-10-11 13:39:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327632888] [2024-10-11 13:39:56,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:39:56,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 13:39:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:56,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 13:39:56,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 13:39:56,621 INFO L87 Difference]: Start difference. First operand 676 states and 858 transitions. Second operand has 33 states, 27 states have (on average 5.777777777777778) internal successors, (156), 31 states have internal predecessors, (156), 14 states have call successors, (54), 6 states have call predecessors, (54), 8 states have return successors, (54), 9 states have call predecessors, (54), 14 states have call successors, (54) [2024-10-11 13:39:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:57,946 INFO L93 Difference]: Finished difference Result 1435 states and 1794 transitions. [2024-10-11 13:39:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 13:39:57,947 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 5.777777777777778) internal successors, (156), 31 states have internal predecessors, (156), 14 states have call successors, (54), 6 states have call predecessors, (54), 8 states have return successors, (54), 9 states have call predecessors, (54), 14 states have call successors, (54) Word has length 147 [2024-10-11 13:39:57,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:57,951 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 13:39:57,951 INFO L226 Difference]: Without dead ends: 760 [2024-10-11 13:39:57,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 13:39:57,954 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1107 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:57,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 975 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:39:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-11 13:39:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 624. [2024-10-11 13:39:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 537 states have (on average 1.217877094972067) internal successors, (654), 539 states have internal predecessors, (654), 56 states have call successors, (56), 30 states have call predecessors, (56), 30 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:39:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 766 transitions. [2024-10-11 13:39:58,039 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 766 transitions. Word has length 147 [2024-10-11 13:39:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:58,039 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 766 transitions. [2024-10-11 13:39:58,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 5.777777777777778) internal successors, (156), 31 states have internal predecessors, (156), 14 states have call successors, (54), 6 states have call predecessors, (54), 8 states have return successors, (54), 9 states have call predecessors, (54), 14 states have call successors, (54) [2024-10-11 13:39:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 766 transitions. [2024-10-11 13:39:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 13:39:58,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:58,040 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:58,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 13:39:58,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:39:58,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:58,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -105372650, now seen corresponding path program 1 times [2024-10-11 13:39:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402035978] [2024-10-11 13:39:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:39:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:39:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:39:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:39:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:39:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:39:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:39:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:39:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:39:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:39:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:39:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:39:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:39:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:39:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:39:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:39:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:39:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:39:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:39:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:39:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402035978] [2024-10-11 13:39:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402035978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:58,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:58,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:39:58,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10717699] [2024-10-11 13:39:58,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:58,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:39:58,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:39:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:39:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:39:58,817 INFO L87 Difference]: Start difference. First operand 624 states and 766 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:59,166 INFO L93 Difference]: Finished difference Result 1162 states and 1419 transitions. [2024-10-11 13:39:59,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:39:59,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-10-11 13:39:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:59,170 INFO L225 Difference]: With dead ends: 1162 [2024-10-11 13:39:59,170 INFO L226 Difference]: Without dead ends: 782 [2024-10-11 13:39:59,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:39:59,172 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 99 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:59,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1821 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:39:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-11 13:39:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 770. [2024-10-11 13:39:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 644 states have (on average 1.2065217391304348) internal successors, (777), 648 states have internal predecessors, (777), 80 states have call successors, (80), 45 states have call predecessors, (80), 45 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 13:39:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 937 transitions. [2024-10-11 13:39:59,284 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 937 transitions. Word has length 148 [2024-10-11 13:39:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 937 transitions. [2024-10-11 13:39:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:39:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 937 transitions. [2024-10-11 13:39:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 13:39:59,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:59,286 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:39:59,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:39:59,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:59,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1274258361, now seen corresponding path program 1 times [2024-10-11 13:39:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:39:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789354648] [2024-10-11 13:39:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:39:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:40:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:40:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:40:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:40:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 126 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-11 13:40:02,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789354648] [2024-10-11 13:40:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789354648] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048080378] [2024-10-11 13:40:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:02,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:40:02,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 13:40:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:03,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-11 13:40:03,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:03,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:40:03,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:40:04,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:40:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 13:40:05,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:06,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2024-10-11 13:40:06,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 142 [2024-10-11 13:40:41,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2024-10-11 13:40:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 135 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-11 13:40:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048080378] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:40:41,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:40:41,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 60 [2024-10-11 13:40:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148863904] [2024-10-11 13:40:41,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:40:41,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-11 13:40:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-11 13:40:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3235, Unknown=1, NotChecked=0, Total=3540 [2024-10-11 13:40:41,406 INFO L87 Difference]: Start difference. First operand 770 states and 937 transitions. Second operand has 60 states, 47 states have (on average 3.8297872340425534) internal successors, (180), 51 states have internal predecessors, (180), 24 states have call successors, (54), 8 states have call predecessors, (54), 14 states have return successors, (54), 17 states have call predecessors, (54), 24 states have call successors, (54) [2024-10-11 13:40:45,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:40:50,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []