./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:32:08,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:32:08,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:32:08,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:32:08,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:32:08,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:32:08,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:32:08,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:32:08,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:32:08,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:32:08,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:32:08,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:32:08,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:32:08,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:32:08,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:32:08,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:32:08,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:32:08,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:32:08,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:32:08,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:32:08,134 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:32:08,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:32:08,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:32:08,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:32:08,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:32:08,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:32:08,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:32:08,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:32:08,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:32:08,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:32:08,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:32:08,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:32:08,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:32:08,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:32:08,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:32:08,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:32:08,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:32:08,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:32:08,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:32:08,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:32:08,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:32:08,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:32:08,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:32:08,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:32:08,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:32:08,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:32:08,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:32:08,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:32:08,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:32:08,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:32:08,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:32:08,191 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:32:08,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:32:08,192 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:32:08,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:32:08,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:32:08,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:32:08,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:32:08,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:32:08,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:32:08,193 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:32:08,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:32:08,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:32:08,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:32:08,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:32:08,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:32:08,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:32:08,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:32:08,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:32:08,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:32:08,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:32:08,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:32:08,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:32:08,196 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:32:08,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:32:08,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:32:08,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d [2022-07-19 17:32:08,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:32:08,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:32:08,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:32:08,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:32:08,419 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:32:08,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-07-19 17:32:08,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96a39326/cbdca10c88be4f5abb0669d021974660/FLAG2f1d33558 [2022-07-19 17:32:08,857 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:32:08,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-07-19 17:32:08,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96a39326/cbdca10c88be4f5abb0669d021974660/FLAG2f1d33558 [2022-07-19 17:32:09,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96a39326/cbdca10c88be4f5abb0669d021974660 [2022-07-19 17:32:09,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:32:09,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:32:09,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:32:09,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:32:09,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:32:09,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3503ea66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09, skipping insertion in model container [2022-07-19 17:32:09,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:32:09,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:32:09,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c[454,467] [2022-07-19 17:32:09,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:32:09,438 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:32:09,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c[454,467] [2022-07-19 17:32:09,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:32:09,485 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:32:09,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09 WrapperNode [2022-07-19 17:32:09,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:32:09,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:32:09,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:32:09,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:32:09,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,507 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-19 17:32:09,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:32:09,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:32:09,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:32:09,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:32:09,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:32:09,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:32:09,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:32:09,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:32:09,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (1/1) ... [2022-07-19 17:32:09,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:32:09,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:09,549 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-19 17:32:09,551 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-19 17:32:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:32:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:32:09,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:32:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:32:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-19 17:32:09,584 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-19 17:32:09,621 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:32:09,622 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:32:09,685 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:32:09,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:32:09,691 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 17:32:09,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:32:09 BoogieIcfgContainer [2022-07-19 17:32:09,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:32:09,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:32:09,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:32:09,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:32:09,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:32:09" (1/3) ... [2022-07-19 17:32:09,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e9f556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:32:09, skipping insertion in model container [2022-07-19 17:32:09,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:09" (2/3) ... [2022-07-19 17:32:09,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e9f556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:32:09, skipping insertion in model container [2022-07-19 17:32:09,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:32:09" (3/3) ... [2022-07-19 17:32:09,700 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2022-07-19 17:32:09,712 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:32:09,712 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:32:09,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:32:09,771 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@233b36fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c4b96c0 [2022-07-19 17:32:09,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:32:09,778 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-19 17:32:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 17:32:09,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:09,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:09,787 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-19 17:32:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:09,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310565831] [2022-07-19 17:32:09,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:09,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:09,978 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-19 17:32:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310565831] [2022-07-19 17:32:09,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310565831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:32:09,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:32:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:32:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745112311] [2022-07-19 17:32:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:32:09,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:32:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:32:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:32:10,017 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-19 17:32:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:10,063 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-19 17:32:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:32:10,066 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-19 17:32:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:10,072 INFO L225 Difference]: With dead ends: 28 [2022-07-19 17:32:10,073 INFO L226 Difference]: Without dead ends: 15 [2022-07-19 17:32:10,075 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-19 17:32:10,079 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-19 17:32:10,080 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-19 17:32:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-19 17:32:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-19 17:32:10,108 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-19 17:32:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-19 17:32:10,110 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-19 17:32:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:10,110 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-19 17:32:10,110 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-19 17:32:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-19 17:32:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 17:32:10,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:10,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:10,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:32:10,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-19 17:32:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:10,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933280265] [2022-07-19 17:32:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,208 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-19 17:32:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:10,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933280265] [2022-07-19 17:32:10,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933280265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:10,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53113983] [2022-07-19 17:32:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:10,215 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-19 17:32:10,235 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-19 17:32:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:32:10,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:10,392 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-19 17:32:10,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:10,579 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-19 17:32:10,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53113983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:10,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:10,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-07-19 17:32:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081226285] [2022-07-19 17:32:10,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:10,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 17:32:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 17:32:10,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:32:10,584 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-19 17:32:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:10,621 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-19 17:32:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:32:10,621 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-19 17:32:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:10,622 INFO L225 Difference]: With dead ends: 22 [2022-07-19 17:32:10,622 INFO L226 Difference]: Without dead ends: 18 [2022-07-19 17:32:10,623 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-19 17:32:10,624 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-19 17:32:10,625 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-19 17:32:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-19 17:32:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-19 17:32:10,629 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-19 17:32:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-19 17:32:10,630 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-19 17:32:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:10,630 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-19 17:32:10,630 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-19 17:32:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-19 17:32:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 17:32:10,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:10,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:10,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 17:32:10,847 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-19 17:32:10,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-19 17:32:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:10,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585194361] [2022-07-19 17:32:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:10,989 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-19 17:32:10,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:10,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585194361] [2022-07-19 17:32:10,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585194361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:10,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248815934] [2022-07-19 17:32:10,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:32:10,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:10,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:10,992 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-19 17:32:10,993 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-19 17:32:11,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:32:11,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:11,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:32:11,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:11,118 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-19 17:32:11,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:11,348 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-19 17:32:11,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248815934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:11,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-07-19 17:32:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430913478] [2022-07-19 17:32:11,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:11,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:32:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:11,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:32:11,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:32:11,351 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-19 17:32:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:11,403 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-19 17:32:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:32:11,403 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-19 17:32:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:11,404 INFO L225 Difference]: With dead ends: 25 [2022-07-19 17:32:11,404 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 17:32:11,405 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-19 17:32:11,406 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-19 17:32:11,406 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-19 17:32:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 17:32:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-19 17:32:11,410 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-19 17:32:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-19 17:32:11,411 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-19 17:32:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:11,412 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-19 17:32:11,412 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-19 17:32:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-19 17:32:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 17:32:11,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:11,413 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:11,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:32:11,631 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-19 17:32:11,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-19 17:32:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:11,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465841823] [2022-07-19 17:32:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:11,810 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-19 17:32:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:11,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465841823] [2022-07-19 17:32:11,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465841823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:11,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686302046] [2022-07-19 17:32:11,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:32:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:11,817 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-19 17:32:11,819 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-19 17:32:11,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 17:32:11,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:11,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:32:11,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 17:32:11,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:12,360 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-19 17:32:12,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686302046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:12,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:12,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-07-19 17:32:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905040706] [2022-07-19 17:32:12,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:12,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 17:32:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 17:32:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:32:12,363 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-19 17:32:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:12,616 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-19 17:32:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 17:32:12,617 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-19 17:32:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:12,618 INFO L225 Difference]: With dead ends: 39 [2022-07-19 17:32:12,618 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 17:32:12,620 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-19 17:32:12,620 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-19 17:32:12,621 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-19 17:32:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 17:32:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-19 17:32:12,626 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-19 17:32:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-19 17:32:12,627 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-19 17:32:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:12,627 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-19 17:32:12,628 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-19 17:32:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-19 17:32:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 17:32:12,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:12,629 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:12,651 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-19 17:32:12,843 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-19 17:32:12,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-07-19 17:32:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:12,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852718249] [2022-07-19 17:32:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:13,076 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-19 17:32:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:13,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852718249] [2022-07-19 17:32:13,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852718249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:13,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920962919] [2022-07-19 17:32:13,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 17:32:13,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:13,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:13,079 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-19 17:32:13,085 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-19 17:32:13,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 17:32:13,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:13,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 17:32:13,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:13,227 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-19 17:32:13,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:14,958 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-19 17:32:14,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920962919] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:14,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-07-19 17:32:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835289947] [2022-07-19 17:32:14,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:14,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 17:32:14,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:14,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 17:32:14,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:32:14,960 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-19 17:32:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:15,074 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-19 17:32:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:32:15,075 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-19 17:32:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:15,076 INFO L225 Difference]: With dead ends: 40 [2022-07-19 17:32:15,076 INFO L226 Difference]: Without dead ends: 36 [2022-07-19 17:32:15,077 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-19 17:32:15,078 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-19 17:32:15,078 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-19 17:32:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-19 17:32:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-19 17:32:15,082 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-19 17:32:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-19 17:32:15,088 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-19 17:32:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:15,089 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-19 17:32:15,089 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-19 17:32:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-19 17:32:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 17:32:15,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:15,092 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:15,119 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-19 17:32:15,304 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-19 17:32:15,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2022-07-19 17:32:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:15,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468376075] [2022-07-19 17:32:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:15,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,566 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-19 17:32:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468376075] [2022-07-19 17:32:15,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468376075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231820099] [2022-07-19 17:32:15,567 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 17:32:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:15,568 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-19 17:32:15,569 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-19 17:32:15,645 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-19 17:32:15,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:15,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 17:32:15,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:15,898 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-19 17:32:15,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:17,968 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-19 17:32:17,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231820099] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:17,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:17,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2022-07-19 17:32:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131056500] [2022-07-19 17:32:17,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:17,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 17:32:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:17,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 17:32:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-07-19 17:32:17,972 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-19 17:32:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:18,649 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-19 17:32:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-19 17:32:18,650 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-19 17:32:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:18,651 INFO L225 Difference]: With dead ends: 69 [2022-07-19 17:32:18,651 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 17:32:18,654 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-19 17:32:18,655 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-19 17:32:18,655 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-19 17:32:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 17:32:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-19 17:32:18,662 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-19 17:32:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-19 17:32:18,663 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-07-19 17:32:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:18,664 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-19 17:32:18,664 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-19 17:32:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-19 17:32:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 17:32:18,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:18,666 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:18,690 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-19 17:32:18,880 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-19 17:32:18,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2022-07-19 17:32:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:18,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799477039] [2022-07-19 17:32:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,513 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-19 17:32:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799477039] [2022-07-19 17:32:19,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799477039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271142135] [2022-07-19 17:32:19,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 17:32:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:19,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:19,516 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-19 17:32:19,524 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-19 17:32:19,662 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-19 17:32:19,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:19,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 17:32:19,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:20,385 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-19 17:32:20,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:33,795 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-19 17:32:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271142135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:33,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:33,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 65 [2022-07-19 17:32:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214057864] [2022-07-19 17:32:33,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:33,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-19 17:32:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-19 17:32:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=3517, Unknown=0, NotChecked=0, Total=4160 [2022-07-19 17:32:33,799 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-19 17:32:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:34,691 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-19 17:32:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 17:32:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) Word has length 112 [2022-07-19 17:32:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:34,701 INFO L225 Difference]: With dead ends: 78 [2022-07-19 17:32:34,702 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 17:32:34,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1853, Invalid=9277, Unknown=0, NotChecked=0, Total=11130 [2022-07-19 17:32:34,706 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:34,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 111 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:32:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 17:32:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-19 17:32:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 17:32:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-19 17:32:34,724 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 112 [2022-07-19 17:32:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:34,724 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-19 17:32:34,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-19 17:32:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-19 17:32:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 17:32:34,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:34,727 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:34,746 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-19 17:32:34,935 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-19 17:32:34,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 7 times [2022-07-19 17:32:34,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:34,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724073937] [2022-07-19 17:32:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:34,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:32:34,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:32:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:32:35,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:32:35,030 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:32:35,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:32:35,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:32:35,036 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-19 17:32:35,040 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:32:35,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:32:35 BoogieIcfgContainer [2022-07-19 17:32:35,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:32:35,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:32:35,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:32:35,082 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:32:35,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:32:09" (3/4) ... [2022-07-19 17:32:35,084 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:32:35,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:32:35,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:32:35,140 INFO L158 Benchmark]: Toolchain (without parser) took 25858.01ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 65.8MB in the beginning and 73.9MB in the end (delta: -8.0MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2022-07-19 17:32:35,140 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:32:35,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.67ms. Allocated memory is still 104.9MB. Free memory was 65.7MB in the beginning and 81.2MB in the end (delta: -15.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 17:32:35,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.38ms. Allocated memory is still 104.9MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:32:35,141 INFO L158 Benchmark]: Boogie Preprocessor took 12.63ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 79.1MB in the end (delta: 709.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:32:35,141 INFO L158 Benchmark]: RCFGBuilder took 171.61ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 70.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 17:32:35,142 INFO L158 Benchmark]: TraceAbstraction took 25387.07ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 69.7MB in the beginning and 78.1MB in the end (delta: -8.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-07-19 17:32:35,142 INFO L158 Benchmark]: Witness Printer took 57.58ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 17:32:35,144 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 104.9MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.67ms. Allocated memory is still 104.9MB. Free memory was 65.7MB in the beginning and 81.2MB in the end (delta: -15.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.38ms. Allocated memory is still 104.9MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.63ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 79.1MB in the end (delta: 709.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 171.61ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 70.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25387.07ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 69.7MB in the beginning and 78.1MB in the end (delta: -8.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * Witness Printer took 57.58ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 73.9MB 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 = 20; VAL [input=20] [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=20, input=20] [L13] int result = id(input); [L14] COND TRUE result == 20 VAL [input=20, result=20] [L15] reach_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 69 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 540 SyntacticMatches, 1 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4888 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 2021 SizeOfPredicates, 13 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 1875/3858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 17:32:35,195 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