./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/fibo_7-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 b2c28e4a28eb31322d66c263b5716511ec5353f2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:00:21,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:00:21,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:00:21,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:00:21,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:00:21,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:00:21,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:00:21,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:00:21,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:00:21,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:00:21,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:00:21,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:00:21,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:00:21,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:00:21,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:00:21,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:00:21,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:00:21,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:00:21,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:00:21,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:00:21,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:00:21,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:00:21,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:00:21,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:00:21,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:00:21,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:00:21,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:00:21,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:00:21,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:00:21,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:00:21,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:00:21,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:00:21,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:00:21,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:00:21,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:00:21,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:00:21,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:00:21,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:00:21,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:00:21,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:00:21,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:00:21,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:00:21,395 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:00:21,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:00:21,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:00:21,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:00:21,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:00:21,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:00:21,398 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:00:21,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:00:21,399 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:00:21,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:00:21,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:00:21,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:00:21,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:00:21,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:00:21,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:00:21,400 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:00:21,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:00:21,401 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:00:21,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:00:21,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:00:21,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:00:21,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:00:21,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:00:21,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:00:21,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:00:21,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:00:21,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:00:21,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:00:21,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:00:21,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:00:21,403 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 -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2021-08-26 09:00:21,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:00:21,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:00:21,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:00:21,724 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:00:21,725 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:00:21,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-08-26 09:00:21,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e0ae4062/13d1e5ef88a649b4b276f4cf5a90ae59/FLAG3a9464a2b [2021-08-26 09:00:22,224 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:00:22,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-08-26 09:00:22,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e0ae4062/13d1e5ef88a649b4b276f4cf5a90ae59/FLAG3a9464a2b [2021-08-26 09:00:22,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e0ae4062/13d1e5ef88a649b4b276f4cf5a90ae59 [2021-08-26 09:00:22,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:00:22,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:00:22,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:00:22,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:00:22,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:00:22,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ac54a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22, skipping insertion in model container [2021-08-26 09:00:22,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:00:22,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:00:22,716 WARN L228 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/fibo_7-2.c[741,754] [2021-08-26 09:00:22,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:00:22,732 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:00:22,743 WARN L228 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/fibo_7-2.c[741,754] [2021-08-26 09:00:22,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:00:22,753 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:00:22,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22 WrapperNode [2021-08-26 09:00:22,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:00:22,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:00:22,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:00:22,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:00:22,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:00:22,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:00:22,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:00:22,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:00:22,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:00:22,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:00:22,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:00:22,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:00:22,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (1/1) ... [2021-08-26 09:00:22,840 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:00:22,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:22,886 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) [2021-08-26 09:00:22,901 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 [2021-08-26 09:00:22,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:00:22,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:00:22,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:00:22,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:00:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-08-26 09:00:22,932 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-08-26 09:00:23,122 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:00:23,122 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 09:00:23,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:00:23 BoogieIcfgContainer [2021-08-26 09:00:23,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:00:23,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:00:23,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:00:23,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:00:23,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:00:22" (1/3) ... [2021-08-26 09:00:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cb0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:00:23, skipping insertion in model container [2021-08-26 09:00:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:22" (2/3) ... [2021-08-26 09:00:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cb0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:00:23, skipping insertion in model container [2021-08-26 09:00:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:00:23" (3/3) ... [2021-08-26 09:00:23,142 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2021-08-26 09:00:23,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:00:23,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 09:00:23,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:00:23,209 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 09:00:23,209 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 09:00:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-26 09:00:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 09:00:23,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:23,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:23,229 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-08-26 09:00:23,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:23,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802319728] [2021-08-26 09:00:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:23,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:00:23,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:23,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802319728] [2021-08-26 09:00:23,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802319728] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:00:23,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:00:23,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:00:23,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61551195] [2021-08-26 09:00:23,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:00:23,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:00:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:23,500 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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) [2021-08-26 09:00:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:23,540 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-08-26 09:00:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:00:23,542 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 [2021-08-26 09:00:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:23,547 INFO L225 Difference]: With dead ends: 34 [2021-08-26 09:00:23,548 INFO L226 Difference]: Without dead ends: 18 [2021-08-26 09:00:23,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-26 09:00:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-26 09:00:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 09:00:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 09:00:23,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-26 09:00:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:23,578 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 09:00:23,579 INFO L471 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) [2021-08-26 09:00:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 09:00:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 09:00:23,580 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:23,581 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:23,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:00:23,581 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:23,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-08-26 09:00:23,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:23,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387826296] [2021-08-26 09:00:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:23,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:00:23,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:23,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387826296] [2021-08-26 09:00:23,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387826296] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:00:23,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:00:23,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:00:23,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071862314] [2021-08-26 09:00:23,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:00:23,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:23,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:00:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:23,695 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-08-26 09:00:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:23,716 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-26 09:00:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:00:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2021-08-26 09:00:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:23,718 INFO L225 Difference]: With dead ends: 24 [2021-08-26 09:00:23,718 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 09:00:23,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 09:00:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-26 09:00:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 09:00:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 09:00:23,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-26 09:00:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:23,726 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 09:00:23,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-08-26 09:00:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 09:00:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 09:00:23,728 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:23,728 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:23,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:00:23,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-08-26 09:00:23,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:23,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035285849] [2021-08-26 09:00:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:23,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-26 09:00:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 09:00:23,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:23,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035285849] [2021-08-26 09:00:23,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035285849] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:23,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880294714] [2021-08-26 09:00:23,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:23,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:23,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:23,863 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) [2021-08-26 09:00:23,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 09:00:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 09:00:23,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 09:00:24,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880294714] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:24,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:24,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-26 09:00:24,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800183242] [2021-08-26 09:00:24,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 09:00:24,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 09:00:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:00:24,104 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-26 09:00:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:24,233 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-08-26 09:00:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 09:00:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2021-08-26 09:00:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:24,235 INFO L225 Difference]: With dead ends: 35 [2021-08-26 09:00:24,235 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 09:00:24,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-08-26 09:00:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 09:00:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-26 09:00:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-26 09:00:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-08-26 09:00:24,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-08-26 09:00:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:24,239 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-26 09:00:24,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-26 09:00:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-08-26 09:00:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 09:00:24,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:24,240 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:24,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:24,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:24,458 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-08-26 09:00:24,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:24,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44737879] [2021-08-26 09:00:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:24,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:24,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:00:24,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:24,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44737879] [2021-08-26 09:00:24,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44737879] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:24,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952397749] [2021-08-26 09:00:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:24,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:24,692 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) [2021-08-26 09:00:24,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 09:00:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:24,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 09:00:24,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:00:24,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952397749] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:24,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:24,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-08-26 09:00:24,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184592782] [2021-08-26 09:00:24,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 09:00:24,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 09:00:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-26 09:00:24,959 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 09:00:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:25,090 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-08-26 09:00:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 09:00:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-08-26 09:00:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:25,097 INFO L225 Difference]: With dead ends: 38 [2021-08-26 09:00:25,097 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 09:00:25,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:00:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 09:00:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-26 09:00:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-08-26 09:00:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-08-26 09:00:25,119 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-08-26 09:00:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:25,120 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-08-26 09:00:25,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 09:00:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-08-26 09:00:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 09:00:25,121 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:25,121 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:25,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:25,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-26 09:00:25,337 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-08-26 09:00:25,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:25,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49058102] [2021-08-26 09:00:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:25,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-26 09:00:25,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:25,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49058102] [2021-08-26 09:00:25,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49058102] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:25,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205580407] [2021-08-26 09:00:25,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 09:00:25,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:25,431 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) [2021-08-26 09:00:25,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 09:00:25,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 09:00:25,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:25,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 09:00:25,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 09:00:25,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205580407] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:25,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:25,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-26 09:00:25,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227682107] [2021-08-26 09:00:25,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 09:00:25,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:25,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 09:00:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-26 09:00:25,666 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-26 09:00:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:25,799 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-08-26 09:00:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 09:00:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 37 [2021-08-26 09:00:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:25,800 INFO L225 Difference]: With dead ends: 69 [2021-08-26 09:00:25,800 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 09:00:25,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 106.8ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-08-26 09:00:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 09:00:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-26 09:00:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-26 09:00:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-08-26 09:00:25,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-08-26 09:00:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:25,805 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-08-26 09:00:25,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-08-26 09:00:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-08-26 09:00:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-26 09:00:25,806 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:25,806 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:25,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:26,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:26,026 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-08-26 09:00:26,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:26,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891764182] [2021-08-26 09:00:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:26,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-08-26 09:00:26,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:26,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891764182] [2021-08-26 09:00:26,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891764182] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:26,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009863012] [2021-08-26 09:00:26,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 09:00:26,277 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:26,297 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) [2021-08-26 09:00:26,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 09:00:26,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-26 09:00:26,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:26,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 09:00:26,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-08-26 09:00:26,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009863012] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:26,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:26,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-08-26 09:00:26,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993466694] [2021-08-26 09:00:26,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 09:00:26,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 09:00:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-26 09:00:26,562 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-26 09:00:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:26,676 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-08-26 09:00:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 09:00:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 65 [2021-08-26 09:00:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:26,678 INFO L225 Difference]: With dead ends: 85 [2021-08-26 09:00:26,679 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 09:00:26,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 75.3ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:00:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 09:00:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-08-26 09:00:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-26 09:00:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-08-26 09:00:26,684 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-08-26 09:00:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:26,685 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-08-26 09:00:26,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-26 09:00:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-08-26 09:00:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-26 09:00:26,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:26,688 INFO L512 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:26,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:26,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:26,905 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-08-26 09:00:26,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:26,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112071966] [2021-08-26 09:00:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:26,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-26 09:00:27,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:27,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112071966] [2021-08-26 09:00:27,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112071966] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:27,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515908706] [2021-08-26 09:00:27,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 09:00:27,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:27,341 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) [2021-08-26 09:00:27,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 09:00:27,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 09:00:27,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:27,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 09:00:27,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-26 09:00:27,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515908706] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:27,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:27,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2021-08-26 09:00:27,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491879998] [2021-08-26 09:00:27,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 09:00:27,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 09:00:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-26 09:00:27,912 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2021-08-26 09:00:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:28,051 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-08-26 09:00:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 09:00:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) Word has length 147 [2021-08-26 09:00:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:28,055 INFO L225 Difference]: With dead ends: 117 [2021-08-26 09:00:28,055 INFO L226 Difference]: Without dead ends: 113 [2021-08-26 09:00:28,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:00:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-26 09:00:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-08-26 09:00:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2021-08-26 09:00:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-08-26 09:00:28,066 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-08-26 09:00:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:28,067 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-08-26 09:00:28,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2021-08-26 09:00:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-08-26 09:00:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-08-26 09:00:28,069 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:28,070 INFO L512 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:28,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:28,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:28,286 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-08-26 09:00:28,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:28,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132889224] [2021-08-26 09:00:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:28,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-08-26 09:00:28,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:28,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132889224] [2021-08-26 09:00:28,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132889224] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:28,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302994402] [2021-08-26 09:00:28,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 09:00:28,759 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:28,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:28,760 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) [2021-08-26 09:00:28,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 09:00:28,967 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-08-26 09:00:28,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:28,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 09:00:28,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-08-26 09:00:29,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302994402] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:29,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:29,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2021-08-26 09:00:29,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554066157] [2021-08-26 09:00:29,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-26 09:00:29,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-26 09:00:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-08-26 09:00:29,548 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2021-08-26 09:00:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:30,260 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-08-26 09:00:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-26 09:00:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) Word has length 215 [2021-08-26 09:00:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:30,263 INFO L225 Difference]: With dead ends: 193 [2021-08-26 09:00:30,263 INFO L226 Difference]: Without dead ends: 95 [2021-08-26 09:00:30,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 442.3ms TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2021-08-26 09:00:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-26 09:00:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-08-26 09:00:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2021-08-26 09:00:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-08-26 09:00:30,286 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-08-26 09:00:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:30,286 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-26 09:00:30,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2021-08-26 09:00:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-08-26 09:00:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-08-26 09:00:30,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:30,290 INFO L512 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:30,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:30,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:30,500 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2021-08-26 09:00:30,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:30,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234196267] [2021-08-26 09:00:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:30,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 09:00:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-08-26 09:00:31,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:31,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234196267] [2021-08-26 09:00:31,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234196267] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:31,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641215484] [2021-08-26 09:00:31,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 09:00:31,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:31,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 09:00:31,862 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2021-08-26 09:00:31,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:31,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 09:00:31,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1045 proven. 197 refuted. 0 times theorem prover too weak. 5878 trivial. 0 not checked. [2021-08-26 09:00:32,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641215484] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:32,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:32,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9] total 27 [2021-08-26 09:00:32,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728725199] [2021-08-26 09:00:32,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-26 09:00:32,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-26 09:00:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-08-26 09:00:32,755 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 14 states have call successors, (18), 1 states have call predecessors, (18), 14 states have return successors, (30), 23 states have call predecessors, (30), 14 states have call successors, (30) [2021-08-26 09:00:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:33,271 INFO L93 Difference]: Finished difference Result 214 states and 375 transitions. [2021-08-26 09:00:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-26 09:00:33,271 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 14 states have call successors, (18), 1 states have call predecessors, (18), 14 states have return successors, (30), 23 states have call predecessors, (30), 14 states have call successors, (30) Word has length 351 [2021-08-26 09:00:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:33,273 INFO L225 Difference]: With dead ends: 214 [2021-08-26 09:00:33,273 INFO L226 Difference]: Without dead ends: 121 [2021-08-26 09:00:33,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 431.9ms TimeCoverageRelationStatistics Valid=480, Invalid=1872, Unknown=0, NotChecked=0, Total=2352 [2021-08-26 09:00:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-26 09:00:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2021-08-26 09:00:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 71 states have internal predecessors, (76), 20 states have call successors, (20), 16 states have call predecessors, (20), 8 states have return successors, (38), 14 states have call predecessors, (38), 20 states have call successors, (38) [2021-08-26 09:00:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2021-08-26 09:00:33,282 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 351 [2021-08-26 09:00:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:33,282 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2021-08-26 09:00:33,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 14 states have call successors, (18), 1 states have call predecessors, (18), 14 states have return successors, (30), 23 states have call predecessors, (30), 14 states have call successors, (30) [2021-08-26 09:00:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2021-08-26 09:00:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-26 09:00:33,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:33,285 INFO L512 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:33,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:33,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:33,503 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 7 times [2021-08-26 09:00:33,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:33,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4593775] [2021-08-26 09:00:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:33,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:00:33,527 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 09:00:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:00:33,592 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 09:00:33,593 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 09:00:33,593 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:00:33,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:00:33,598 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:00:33,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:00:33 BoogieIcfgContainer [2021-08-26 09:00:33,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:00:33,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:00:33,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:00:33,660 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:00:33,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:00:23" (3/4) ... [2021-08-26 09:00:33,662 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 09:00:33,712 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:00:33,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:00:33,713 INFO L168 Benchmark]: Toolchain (without parser) took 11114.81 ms. Allocated memory was 52.4 MB in the beginning and 239.1 MB in the end (delta: 186.6 MB). Free memory was 29.4 MB in the beginning and 175.6 MB in the end (delta: -146.1 MB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:33,714 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 52.4 MB. Free memory was 33.7 MB in the beginning and 33.7 MB in the end (delta: 34.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:00:33,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.57 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 29.3 MB in the beginning and 48.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:33,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.27 ms. Allocated memory is still 69.2 MB. Free memory was 48.0 MB in the beginning and 52.8 MB in the end (delta: -4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:33,714 INFO L168 Benchmark]: Boogie Preprocessor took 15.96 ms. Allocated memory is still 69.2 MB. Free memory was 52.8 MB in the beginning and 51.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:00:33,715 INFO L168 Benchmark]: RCFGBuilder took 302.49 ms. Allocated memory is still 69.2 MB. Free memory was 51.7 MB in the beginning and 40.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:33,715 INFO L168 Benchmark]: TraceAbstraction took 10521.78 ms. Allocated memory was 69.2 MB in the beginning and 239.1 MB in the end (delta: 169.9 MB). Free memory was 39.5 MB in the beginning and 188.2 MB in the end (delta: -148.7 MB). Peak memory consumption was 109.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:33,715 INFO L168 Benchmark]: Witness Printer took 52.58 ms. Allocated memory is still 239.1 MB. Free memory was 188.2 MB in the beginning and 175.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:33,716 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.10 ms. Allocated memory is still 52.4 MB. Free memory was 33.7 MB in the beginning and 33.7 MB in the end (delta: 34.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 156.57 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 29.3 MB in the beginning and 48.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.27 ms. Allocated memory is still 69.2 MB. Free memory was 48.0 MB in the beginning and 52.8 MB in the end (delta: -4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 15.96 ms. Allocated memory is still 69.2 MB. Free memory was 52.8 MB in the beginning and 51.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 302.49 ms. Allocated memory is still 69.2 MB. Free memory was 51.7 MB in the beginning and 40.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10521.78 ms. Allocated memory was 69.2 MB in the beginning and 239.1 MB in the end (delta: 169.9 MB). Free memory was 39.5 MB in the beginning and 188.2 MB in the end (delta: -148.7 MB). Peak memory consumption was 109.2 MB. Max. memory is 16.1 GB. * Witness Printer took 52.58 ms. Allocated memory is still 239.1 MB. Free memory was 188.2 MB in the beginning and 175.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10409.1ms, OverallIterations: 10, TraceHistogramMax: 51, EmptinessCheckTime: 26.8ms, AutomataDifference: 1991.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 179 SDtfs, 521 SDslu, 598 SDs, 0 SdLazy, 1348 SolverSat, 600 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 928.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1262 GetRequests, 1104 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1395.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=7, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 94.7ms AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 103.6ms SsaConstructionTime, 431.1ms SatisfiabilityAnalysisTime, 5168.2ms InterpolantComputationTime, 2028 NumberOfCodeBlocks, 1930 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1729 ConstructedInterpolants, 0 QuantifiedInterpolants, 2857 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1833 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 18235/22234 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! [2021-08-26 09:00:33,746 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...