./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-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_i25_o25-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 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:08:36,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:08:36,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:08:36,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:08:36,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:08:36,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:08:36,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:08:36,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:08:36,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:08:36,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:08:36,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:08:36,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:08:36,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:08:36,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:08:36,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:08:36,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:08:36,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:08:36,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:08:36,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:08:36,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:08:36,666 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:08:36,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:08:36,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:08:36,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:08:36,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:08:36,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:08:36,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:08:36,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:08:36,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:08:36,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:08:36,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:08:36,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:08:36,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:08:36,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:08:36,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:08:36,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:08:36,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:08:36,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:08:36,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:08:36,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:08:36,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:08:36,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:08:36,692 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:36,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:08:36,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:08:36,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:08:36,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:08:36,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:08:36,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:08:36,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:08:36,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:08:36,721 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:08:36,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:08:36,723 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:08:36,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:08:36,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:08:36,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:08:36,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:08:36,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:08:36,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:08:36,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:08:36,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:08:36,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:08:36,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:08:36,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:08:36,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:08:36,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:08:36,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:08:36,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:08:36,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:08:36,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:08:36,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:08:36,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:08:36,727 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:08:36,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:08:36,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:08:36,727 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 -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2022-07-21 05:08:37,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:08:37,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:08:37,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:08:37,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:08:37,095 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:08:37,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-07-21 05:08:37,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0982e79/d840bf06a1a445ce95af74f7066e7f93/FLAG2a05d8961 [2022-07-21 05:08:37,576 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:08:37,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-07-21 05:08:37,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0982e79/d840bf06a1a445ce95af74f7066e7f93/FLAG2a05d8961 [2022-07-21 05:08:38,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0982e79/d840bf06a1a445ce95af74f7066e7f93 [2022-07-21 05:08:38,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:08:38,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:08:38,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:08:38,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:08:38,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:08:38,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:08:38" (1/1) ... [2022-07-21 05:08:38,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf7606e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:38, skipping insertion in model container [2022-07-21 05:08:38,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:08:38" (1/1) ... [2022-07-21 05:08:38,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:08:38,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:08:38,176 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_i25_o25-2.c[454,467] [2022-07-21 05:08:38,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:08:38,186 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:08:38,199 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_i25_o25-2.c[454,467] [2022-07-21 05:08:38,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:08:38,209 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:08:38,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:38 WrapperNode [2022-07-21 05:08:38,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:08:38,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:08:38,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:08:38,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:08:38,237 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:38" (1/1) ... [2022-07-21 05:08:38,261 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:38" (1/1) ... [2022-07-21 05:08:38,274 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-21 05:08:38,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:08:38,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:08:38,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:08:38,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:08:38,281 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:38" (1/1) ... [2022-07-21 05:08:38,281 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:38" (1/1) ... [2022-07-21 05:08:38,282 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:38" (1/1) ... [2022-07-21 05:08:38,283 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:38" (1/1) ... [2022-07-21 05:08:38,285 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:38" (1/1) ... [2022-07-21 05:08:38,286 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:38" (1/1) ... [2022-07-21 05:08:38,289 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:38" (1/1) ... [2022-07-21 05:08:38,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:08:38,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:08:38,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:08:38,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:08:38,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:38" (1/1) ... [2022-07-21 05:08:38,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:08:38,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:38,320 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:38,346 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:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:08:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:08:38,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:08:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:08:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-21 05:08:38,362 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-21 05:08:38,423 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:08:38,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:08:38,531 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:08:38,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:08:38,537 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:08:38,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:38 BoogieIcfgContainer [2022-07-21 05:08:38,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:08:38,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:08:38,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:08:38,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:08:38,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:08:38" (1/3) ... [2022-07-21 05:08:38,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba0de29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:08:38, skipping insertion in model container [2022-07-21 05:08:38,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:08:38" (2/3) ... [2022-07-21 05:08:38,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba0de29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:08:38, skipping insertion in model container [2022-07-21 05:08:38,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:08:38" (3/3) ... [2022-07-21 05:08:38,546 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2022-07-21 05:08:38,560 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:08:38,560 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:08:38,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:08:38,621 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@3259be70, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44d2c7eb [2022-07-21 05:08:38,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:08:38,626 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:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 05:08:38,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:38,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:38,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-21 05:08:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:38,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066976954] [2022-07-21 05:08:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:38,865 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:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066976954] [2022-07-21 05:08:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066976954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:08:38,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:08:38,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:08:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013159640] [2022-07-21 05:08:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:08:38,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:08:38,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:08:38,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:08:38,894 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:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:38,925 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-21 05:08:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:08:38,927 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:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:38,933 INFO L225 Difference]: With dead ends: 28 [2022-07-21 05:08:38,933 INFO L226 Difference]: Without dead ends: 15 [2022-07-21 05:08:38,936 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:38,941 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:38,942 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:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-21 05:08:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-21 05:08:38,982 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:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-21 05:08:38,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-21 05:08:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:38,985 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-21 05:08:38,985 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:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-21 05:08:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 05:08:38,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:38,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:08:38,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-21 05:08:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145051715] [2022-07-21 05:08:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,068 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:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145051715] [2022-07-21 05:08:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145051715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066883051] [2022-07-21 05:08:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:39,072 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:39,073 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:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:08:39,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:39,217 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:39,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:39,412 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:39,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066883051] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:39,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:39,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-07-21 05:08:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334580917] [2022-07-21 05:08:39,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:39,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 05:08:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:39,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 05:08:39,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:08:39,417 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:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:39,469 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-21 05:08:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:08:39,470 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:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:39,480 INFO L225 Difference]: With dead ends: 22 [2022-07-21 05:08:39,480 INFO L226 Difference]: Without dead ends: 18 [2022-07-21 05:08:39,481 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:39,482 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:39,483 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:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-21 05:08:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-21 05:08:39,487 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:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-21 05:08:39,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-21 05:08:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:39,488 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-21 05:08:39,489 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:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-21 05:08:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 05:08:39,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:39,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:39,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:39,714 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:39,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:39,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:39,716 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-21 05:08:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470631346] [2022-07-21 05:08:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:39,840 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:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:39,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470631346] [2022-07-21 05:08:39,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470631346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:39,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138079404] [2022-07-21 05:08:39,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:08:39,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:39,843 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:39,846 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:39,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:08:39,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:39,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:08:39,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:39,944 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:39,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:40,197 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:40,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138079404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:40,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:40,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-07-21 05:08:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776094177] [2022-07-21 05:08:40,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:40,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:08:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:08:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:08:40,206 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:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:40,279 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-21 05:08:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:08:40,280 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:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:40,280 INFO L225 Difference]: With dead ends: 25 [2022-07-21 05:08:40,281 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 05:08:40,281 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:40,282 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:40,283 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:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 05:08:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 05:08:40,291 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:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-21 05:08:40,293 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-21 05:08:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:40,293 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-21 05:08:40,293 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:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-21 05:08:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 05:08:40,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:40,296 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:40,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 05:08:40,499 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:40,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-21 05:08:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:40,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329623870] [2022-07-21 05:08:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:40,653 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:40,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:40,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329623870] [2022-07-21 05:08:40,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329623870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:40,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495390980] [2022-07-21 05:08:40,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:08:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:40,656 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:40,659 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:40,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 05:08:40,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:40,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:08:40,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:40,844 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:40,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:41,262 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:41,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495390980] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:41,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:41,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-07-21 05:08:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829464251] [2022-07-21 05:08:41,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:41,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 05:08:41,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:41,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 05:08:41,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-07-21 05:08:41,269 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:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:41,537 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-21 05:08:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 05:08:41,539 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:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:41,540 INFO L225 Difference]: With dead ends: 39 [2022-07-21 05:08:41,540 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 05:08:41,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-07-21 05:08:41,542 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:41,542 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:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 05:08:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-21 05:08:41,547 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:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-21 05:08:41,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-21 05:08:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:41,549 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-21 05:08:41,549 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:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-21 05:08:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 05:08:41,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:41,551 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:41,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 05:08:41,755 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:41,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-07-21 05:08:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:41,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327882436] [2022-07-21 05:08:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:42,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:42,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:42,029 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:42,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:42,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327882436] [2022-07-21 05:08:42,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327882436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:42,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958941468] [2022-07-21 05:08:42,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:08:42,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:42,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:42,032 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:42,034 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:42,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:08:42,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:42,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 05:08:42,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:42,186 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:42,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:43,966 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:43,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958941468] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:43,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:43,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-07-21 05:08:43,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990644857] [2022-07-21 05:08:43,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:43,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 05:08:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:43,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 05:08:43,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:08:43,969 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:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:44,090 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-21 05:08:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:08:44,091 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:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:44,092 INFO L225 Difference]: With dead ends: 40 [2022-07-21 05:08:44,092 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 05:08:44,093 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:44,093 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:44,094 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:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 05:08:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 05:08:44,098 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:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-21 05:08:44,102 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-21 05:08:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:44,103 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-21 05:08:44,103 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:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-21 05:08:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 05:08:44,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:44,106 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:44,130 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:44,306 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:44,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:44,307 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2022-07-21 05:08:44,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:44,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562581934] [2022-07-21 05:08:44,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:44,525 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:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562581934] [2022-07-21 05:08:44,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562581934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312106844] [2022-07-21 05:08:44,527 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:08:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:44,528 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:44,529 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:44,603 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-21 05:08:44,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:44,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 05:08:44,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:44,862 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:44,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:47,109 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:47,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312106844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:47,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:47,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2022-07-21 05:08:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286238320] [2022-07-21 05:08:47,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:47,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 05:08:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 05:08:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 05:08:47,112 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:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:47,714 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-21 05:08:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 05:08:47,714 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:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:47,717 INFO L225 Difference]: With dead ends: 69 [2022-07-21 05:08:47,717 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 05:08:47,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2022-07-21 05:08:47,721 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:47,721 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:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 05:08:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-21 05:08:47,729 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:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-21 05:08:47,730 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-07-21 05:08:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:47,731 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-21 05:08:47,731 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:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-21 05:08:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 05:08:47,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:47,732 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:47,759 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:47,955 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:47,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2022-07-21 05:08:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:47,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240772089] [2022-07-21 05:08:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:48,534 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:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240772089] [2022-07-21 05:08:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240772089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850665079] [2022-07-21 05:08:48,535 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 05:08:48,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:48,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:48,540 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:48,541 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:48,694 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-21 05:08:48,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:48,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-21 05:08:48,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:49,474 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:49,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:09:03,302 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:09:03,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850665079] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:09:03,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:09:03,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 75 [2022-07-21 05:09:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816755492] [2022-07-21 05:09:03,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:09:03,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-21 05:09:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:09:03,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-21 05:09:03,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=4672, Unknown=0, NotChecked=0, Total=5550 [2022-07-21 05:09:03,306 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-21 05:09:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:09:04,490 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-07-21 05:09:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-21 05:09:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) Word has length 112 [2022-07-21 05:09:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:09:04,496 INFO L225 Difference]: With dead ends: 93 [2022-07-21 05:09:04,496 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 05:09:04,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2558, Invalid=13192, Unknown=0, NotChecked=0, Total=15750 [2022-07-21 05:09:04,500 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:09:04,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 121 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:09:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 05:09:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-21 05:09:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 05:09:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-21 05:09:04,512 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 112 [2022-07-21 05:09:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:09:04,512 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-21 05:09:04,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-21 05:09:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-21 05:09:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 05:09:04,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:09:04,515 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:09:04,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 05:09:04,723 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:09:04,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:09:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:09:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash -678635050, now seen corresponding path program 7 times [2022-07-21 05:09:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:09:04,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236931370] [2022-07-21 05:09:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:09:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:09:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:09:04,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:09:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:09:04,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:09:04,863 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:09:04,864 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:09:04,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 05:09:04,869 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-21 05:09:04,873 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:09:04,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:09:04 BoogieIcfgContainer [2022-07-21 05:09:04,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:09:04,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:09:04,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:09:04,928 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:09:04,929 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:38" (3/4) ... [2022-07-21 05:09:04,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:09:04,988 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:09:04,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:09:04,991 INFO L158 Benchmark]: Toolchain (without parser) took 26985.49ms. Allocated memory was 50.3MB in the beginning and 119.5MB in the end (delta: 69.2MB). Free memory was 25.7MB in the beginning and 79.3MB in the end (delta: -53.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-07-21 05:09:04,991 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:09:04,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.02ms. Allocated memory is still 50.3MB. Free memory was 25.5MB in the beginning and 27.1MB in the end (delta: -1.6MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-07-21 05:09:04,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.88ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 27.0MB in the beginning and 50.7MB in the end (delta: -23.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:09:04,992 INFO L158 Benchmark]: Boogie Preprocessor took 16.33ms. Allocated memory is still 67.1MB. Free memory was 50.7MB in the beginning and 49.9MB in the end (delta: 806.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:09:04,992 INFO L158 Benchmark]: RCFGBuilder took 246.53ms. Allocated memory is still 67.1MB. Free memory was 49.9MB in the beginning and 41.5MB in the end (delta: 8.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 05:09:04,992 INFO L158 Benchmark]: TraceAbstraction took 26387.16ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 41.0MB in the beginning and 83.5MB in the end (delta: -42.5MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2022-07-21 05:09:04,993 INFO L158 Benchmark]: Witness Printer took 62.24ms. Allocated memory is still 119.5MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:09:04,994 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.19ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.02ms. Allocated memory is still 50.3MB. Free memory was 25.5MB in the beginning and 27.1MB in the end (delta: -1.6MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.88ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 27.0MB in the beginning and 50.7MB in the end (delta: -23.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.33ms. Allocated memory is still 67.1MB. Free memory was 50.7MB in the beginning and 49.9MB in the end (delta: 806.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.53ms. Allocated memory is still 67.1MB. Free memory was 49.9MB in the beginning and 41.5MB in the end (delta: 8.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26387.16ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 41.0MB in the beginning and 83.5MB in the end (delta: -42.5MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 62.24ms. Allocated memory is still 119.5MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). 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 = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) 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; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 482 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 69 mSDtfsCounter, 639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6263 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 143, 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.3s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 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:09:05,032 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