./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:08:27,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:08:27,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:08:27,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:08:27,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:08:27,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:08:27,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:08:27,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:08:27,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:08:27,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:08:27,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:08:27,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:08:27,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:08:27,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:08:27,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:08:27,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:08:27,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:08:27,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:08:27,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:08:27,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:08:27,896 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:08:27,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:08:27,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:08:27,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:08:27,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:08:27,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:08:27,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:08:27,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:08:27,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:08:27,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:08:27,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:08:27,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:08:27,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:08:27,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:08:27,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:08:27,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:08:27,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:08:27,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:08:27,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:08:27,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:08:27,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:08:27,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:08:27,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:08:27,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:08:27,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:08:27,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:08:27,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:08:27,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:08:27,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:08:27,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:08:27,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:08:27,945 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:08:27,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:08:27,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:08:27,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:08:27,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:08:27,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:08:27,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:08:27,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:08:27,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:08:27,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:08:27,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:08:27,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:08:27,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:08:27,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:08:27,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:08:27,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:08:27,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:08:27,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:08:27,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:08:27,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:08:27,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:08:27,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:08:27,949 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:08:27,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:08:27,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:08:27,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d [2022-07-21 05:08:28,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:08:28,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:08:28,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:08:28,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:08:28,286 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:08:28,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-07-21 05:08:28,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eed40c19/cd574fff1ff74ca891dca5a2d493f139/FLAGfca7e1456 [2022-07-21 05:08:28,778 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:08:28,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-07-21 05:08:28,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eed40c19/cd574fff1ff74ca891dca5a2d493f139/FLAGfca7e1456 [2022-07-21 05:08:28,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eed40c19/cd574fff1ff74ca891dca5a2d493f139 [2022-07-21 05:08:28,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:08:28,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:08:28,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:08:28,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:08:28,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:08:28,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:28,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fbcd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28, skipping insertion in model container [2022-07-21 05:08:28,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:28,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:08:28,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:08:28,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c[454,467] [2022-07-21 05:08:28,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:08:28,942 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:08:28,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c[454,467] [2022-07-21 05:08:28,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:08:28,984 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:08:28,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28 WrapperNode [2022-07-21 05:08:28,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:08:28,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:08:28,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:08:28,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:08:28,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:28,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,006 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-21 05:08:29,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:08:29,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:08:29,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:08:29,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:08:29,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:08:29,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:08:29,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:08:29,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:08:29,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (1/1) ... [2022-07-21 05:08:29,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:08:29,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:29,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 05:08:29,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 05:08:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:08:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:08:29,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:08:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:08:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-21 05:08:29,112 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-21 05:08:29,160 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:08:29,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:08:29,251 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:08:29,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:08:29,257 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:08:29,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:29 BoogieIcfgContainer [2022-07-21 05:08:29,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:08:29,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:08:29,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:08:29,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:08:29,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:08:28" (1/3) ... [2022-07-21 05:08:29,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41004205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:08:29, skipping insertion in model container [2022-07-21 05:08:29,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:28" (2/3) ... [2022-07-21 05:08:29,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41004205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:08:29, skipping insertion in model container [2022-07-21 05:08:29,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:29" (3/3) ... [2022-07-21 05:08:29,265 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2022-07-21 05:08:29,275 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:08:29,276 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:08:29,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:08:29,348 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8c57ee3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ce04df0 [2022-07-21 05:08:29,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:08:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 05:08:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 05:08:29,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:29,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:29,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-21 05:08:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:29,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733510640] [2022-07-21 05:08:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:08:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:29,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733510640] [2022-07-21 05:08:29,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733510640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:08:29,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:08:29,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:08:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784101504] [2022-07-21 05:08:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:08:29,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:08:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:08:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:29,589 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:08:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:29,646 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-21 05:08:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:08:29,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-21 05:08:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:29,662 INFO L225 Difference]: With dead ends: 28 [2022-07-21 05:08:29,663 INFO L226 Difference]: Without dead ends: 15 [2022-07-21 05:08:29,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:29,671 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:29,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:08:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-21 05:08:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-21 05:08:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 05:08:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-21 05:08:29,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-21 05:08:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:29,700 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-21 05:08:29,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:08:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-21 05:08:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 05:08:29,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:29,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:29,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:08:29,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:29,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-21 05:08:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:29,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17600454] [2022-07-21 05:08:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 05:08:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:29,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17600454] [2022-07-21 05:08:29,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17600454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:29,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783515938] [2022-07-21 05:08:29,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:29,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:29,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:29,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:08:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:29,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:08:29,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 05:08:29,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:08:30,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783515938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:30,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-07-21 05:08:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870249940] [2022-07-21 05:08:30,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 05:08:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 05:08:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:08:30,185 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 05:08:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:30,239 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-21 05:08:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:08:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-07-21 05:08:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:30,240 INFO L225 Difference]: With dead ends: 22 [2022-07-21 05:08:30,240 INFO L226 Difference]: Without dead ends: 18 [2022-07-21 05:08:30,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:08:30,241 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:30,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:08:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-21 05:08:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-21 05:08:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 05:08:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-21 05:08:30,266 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-21 05:08:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:30,267 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-21 05:08:30,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 05:08:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-21 05:08:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 05:08:30,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:30,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:30,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 05:08:30,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:30,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-21 05:08:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:30,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217807514] [2022-07-21 05:08:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:08:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:30,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217807514] [2022-07-21 05:08:30,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217807514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:30,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786760010] [2022-07-21 05:08:30,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:08:30,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:30,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:30,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:30,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:08:30,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:08:30,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:30,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:08:30,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 05:08:30,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 05:08:31,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786760010] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:31,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:31,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-07-21 05:08:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883550205] [2022-07-21 05:08:31,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:31,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:08:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:08:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:08:31,028 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 05:08:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:31,068 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-21 05:08:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:08:31,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-07-21 05:08:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:31,070 INFO L225 Difference]: With dead ends: 25 [2022-07-21 05:08:31,070 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 05:08:31,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-21 05:08:31,071 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:31,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:08:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 05:08:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 05:08:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:08:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-21 05:08:31,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-21 05:08:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:31,100 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-21 05:08:31,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-21 05:08:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-21 05:08:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 05:08:31,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:31,103 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:31,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:31,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-21 05:08:31,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-21 05:08:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123288066] [2022-07-21 05:08:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:08:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:31,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123288066] [2022-07-21 05:08:31,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123288066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:31,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221654160] [2022-07-21 05:08:31,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:08:31,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:31,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:31,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:08:31,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 05:08:31,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:31,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:08:31,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:08:31,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:08:31,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221654160] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:31,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:31,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-07-21 05:08:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236162598] [2022-07-21 05:08:31,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:31,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 05:08:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 05:08:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-07-21 05:08:31,968 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 05:08:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:32,164 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-21 05:08:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 05:08:32,166 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2022-07-21 05:08:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:32,166 INFO L225 Difference]: With dead ends: 39 [2022-07-21 05:08:32,167 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 05:08:32,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-07-21 05:08:32,168 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:32,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 05:08:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-21 05:08:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 05:08:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-21 05:08:32,173 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-21 05:08:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:32,174 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-21 05:08:32,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 05:08:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-21 05:08:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 05:08:32,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:32,175 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:32,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:32,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:32,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-07-21 05:08:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:32,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893594034] [2022-07-21 05:08:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-21 05:08:32,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:32,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893594034] [2022-07-21 05:08:32,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893594034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:32,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276337621] [2022-07-21 05:08:32,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:08:32,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:32,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:08:32,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:08:32,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:32,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 05:08:32,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-21 05:08:32,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 05:08:34,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276337621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:34,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:34,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-07-21 05:08:34,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047919330] [2022-07-21 05:08:34,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:34,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 05:08:34,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:34,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 05:08:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:08:34,184 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-21 05:08:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:34,289 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-21 05:08:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:08:34,290 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2022-07-21 05:08:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:34,291 INFO L225 Difference]: With dead ends: 40 [2022-07-21 05:08:34,291 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 05:08:34,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=628, Unknown=0, NotChecked=0, Total=930 [2022-07-21 05:08:34,292 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:34,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 89 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 05:08:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 05:08:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 05:08:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-21 05:08:34,297 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-21 05:08:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:34,297 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-21 05:08:34,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-21 05:08:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-21 05:08:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:08:34,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:34,299 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:34,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:34,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:34,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2022-07-21 05:08:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:34,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517970544] [2022-07-21 05:08:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 05:08:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517970544] [2022-07-21 05:08:34,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517970544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620834106] [2022-07-21 05:08:34,677 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:08:34,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:34,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:34,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:34,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:08:34,806 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-21 05:08:34,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:34,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 05:08:34,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 05:08:35,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 05:08:36,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620834106] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:36,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:36,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2022-07-21 05:08:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032319563] [2022-07-21 05:08:36,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:36,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 05:08:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:36,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 05:08:36,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 05:08:36,898 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-21 05:08:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:37,447 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-21 05:08:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 05:08:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) Word has length 58 [2022-07-21 05:08:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:37,449 INFO L225 Difference]: With dead ends: 69 [2022-07-21 05:08:37,449 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 05:08:37,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2022-07-21 05:08:37,452 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:37,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 143 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 05:08:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-21 05:08:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 05:08:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-21 05:08:37,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-07-21 05:08:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:37,458 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-21 05:08:37,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-21 05:08:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-21 05:08:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 05:08:37,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:37,460 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:37,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:37,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:37,701 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2022-07-21 05:08:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:37,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211042103] [2022-07-21 05:08:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-21 05:08:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:38,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211042103] [2022-07-21 05:08:38,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211042103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623080168] [2022-07-21 05:08:38,214 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 05:08:38,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:38,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:38,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:08:38,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 05:08:38,344 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-21 05:08:38,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:38,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-21 05:08:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-21 05:08:38,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-21 05:08:50,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623080168] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:50,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:50,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 65 [2022-07-21 05:08:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426483239] [2022-07-21 05:08:50,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:50,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-21 05:08:50,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-21 05:08:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=3517, Unknown=0, NotChecked=0, Total=4160 [2022-07-21 05:08:50,293 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-21 05:08:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:51,045 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-21 05:08:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 05:08:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) Word has length 112 [2022-07-21 05:08:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:51,051 INFO L225 Difference]: With dead ends: 78 [2022-07-21 05:08:51,053 INFO L226 Difference]: Without dead ends: 72 [2022-07-21 05:08:51,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1853, Invalid=9277, Unknown=0, NotChecked=0, Total=11130 [2022-07-21 05:08:51,058 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:51,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 111 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-21 05:08:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-21 05:08:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 05:08:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-21 05:08:51,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 112 [2022-07-21 05:08:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:51,075 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-21 05:08:51,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-21 05:08:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-21 05:08:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 05:08:51,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:51,077 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:51,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 05:08:51,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:51,299 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 7 times [2022-07-21 05:08:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:51,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904950380] [2022-07-21 05:08:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:08:51,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:08:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:08:51,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:08:51,371 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:08:51,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:08:51,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 05:08:51,375 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-21 05:08:51,378 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:08:51,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:08:51 BoogieIcfgContainer [2022-07-21 05:08:51,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:08:51,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:08:51,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:08:51,425 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:08:51,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:29" (3/4) ... [2022-07-21 05:08:51,427 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:08:51,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:08:51,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:08:51,492 INFO L158 Benchmark]: Toolchain (without parser) took 22692.10ms. Allocated memory was 58.7MB in the beginning and 293.6MB in the end (delta: 234.9MB). Free memory was 39.4MB in the beginning and 182.3MB in the end (delta: -142.9MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2022-07-21 05:08:51,493 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:51,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.26ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 39.1MB in the beginning and 70.0MB in the end (delta: -30.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 05:08:51,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.66ms. Allocated memory is still 86.0MB. Free memory was 70.0MB in the beginning and 68.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:51,494 INFO L158 Benchmark]: Boogie Preprocessor took 14.99ms. Allocated memory is still 86.0MB. Free memory was 68.6MB in the beginning and 67.7MB in the end (delta: 905.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:51,494 INFO L158 Benchmark]: RCFGBuilder took 235.65ms. Allocated memory is still 86.0MB. Free memory was 67.7MB in the beginning and 59.5MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:08:51,494 INFO L158 Benchmark]: TraceAbstraction took 22164.21ms. Allocated memory was 86.0MB in the beginning and 293.6MB in the end (delta: 207.6MB). Free memory was 58.9MB in the beginning and 185.4MB in the end (delta: -126.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2022-07-21 05:08:51,495 INFO L158 Benchmark]: Witness Printer took 66.99ms. Allocated memory is still 293.6MB. Free memory was 185.4MB in the beginning and 182.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:08:51,496 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.26ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 39.1MB in the beginning and 70.0MB in the end (delta: -30.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.66ms. Allocated memory is still 86.0MB. Free memory was 70.0MB in the beginning and 68.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.99ms. Allocated memory is still 86.0MB. Free memory was 68.6MB in the beginning and 67.7MB in the end (delta: 905.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 235.65ms. Allocated memory is still 86.0MB. Free memory was 67.7MB in the beginning and 59.5MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22164.21ms. Allocated memory was 86.0MB in the beginning and 293.6MB in the end (delta: 207.6MB). Free memory was 58.9MB in the beginning and 185.4MB in the end (delta: -126.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Witness Printer took 66.99ms. Allocated memory is still 293.6MB. Free memory was 185.4MB in the beginning and 182.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 20; VAL [input=20] [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=20, input=20] [L13] int result = id(input); [L14] COND TRUE result == 20 VAL [input=20, result=20] [L15] reach_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 69 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 540 SyntacticMatches, 1 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4888 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 2021 SizeOfPredicates, 13 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 1875/3858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 05:08:51,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE