./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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/Fibonacci05.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 18ab16c8226f43cf595901df83a1f895912e466b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.25-9a8b2e8 [2020-10-20 01:45:38,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:45:38,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:45:38,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:45:38,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:45:38,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:45:38,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:45:38,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:45:38,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:45:38,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:45:38,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:45:38,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:45:38,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:45:38,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:45:38,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:45:38,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:45:38,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:45:38,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:45:38,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:45:38,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:45:38,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:45:38,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:45:38,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:45:38,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:45:38,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:45:38,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:45:38,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:45:38,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:45:38,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:45:38,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:45:38,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:45:38,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:45:38,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:45:38,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:45:38,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:45:38,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:45:38,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:45:38,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:45:38,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:45:38,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:45:38,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:45:38,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:45:38,338 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:45:38,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:45:38,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:45:38,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:45:38,341 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:45:38,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:45:38,342 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:45:38,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:45:38,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:45:38,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:45:38,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:45:38,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:45:38,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:45:38,345 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:45:38,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:45:38,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:45:38,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:45:38,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:45:38,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:45:38,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:45:38,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:45:38,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:45:38,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:45:38,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:45:38,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:45:38,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:45:38,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:45:38,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:45:38,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:45:38,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 18ab16c8226f43cf595901df83a1f895912e466b [2020-10-20 01:45:38,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:45:38,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:45:38,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:45:38,582 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:45:38,582 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:45:38,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2020-10-20 01:45:38,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ee9342/f712eef4526e43bcb5f1cf5287553330/FLAG95ed4bde8 [2020-10-20 01:45:39,052 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:45:39,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2020-10-20 01:45:39,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ee9342/f712eef4526e43bcb5f1cf5287553330/FLAG95ed4bde8 [2020-10-20 01:45:39,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ee9342/f712eef4526e43bcb5f1cf5287553330 [2020-10-20 01:45:39,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:45:39,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:45:39,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:45:39,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:45:39,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:45:39,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14059e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39, skipping insertion in model container [2020-10-20 01:45:39,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:45:39,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:45:39,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:45:39,731 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:45:39,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:45:39,763 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:45:39,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39 WrapperNode [2020-10-20 01:45:39,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:45:39,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:45:39,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:45:39,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:45:39,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:45:39,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:45:39,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:45:39,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:45:39,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... [2020-10-20 01:45:39,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:45:39,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:45:39,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:45:39,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:45:39,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:45:39,870 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-10-20 01:45:39,870 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-10-20 01:45:39,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:45:39,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:45:39,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:45:39,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:45:40,070 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:45:40,070 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 01:45:40,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:45:40 BoogieIcfgContainer [2020-10-20 01:45:40,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:45:40,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:45:40,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:45:40,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:45:40,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:45:39" (1/3) ... [2020-10-20 01:45:40,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30237a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:45:40, skipping insertion in model container [2020-10-20 01:45:40,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:45:39" (2/3) ... [2020-10-20 01:45:40,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30237a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:45:40, skipping insertion in model container [2020-10-20 01:45:40,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:45:40" (3/3) ... [2020-10-20 01:45:40,080 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-10-20 01:45:40,089 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:45:40,095 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:45:40,108 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:45:40,127 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:45:40,127 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:45:40,127 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:45:40,127 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:45:40,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:45:40,128 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:45:40,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:45:40,128 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:45:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-10-20 01:45:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 01:45:40,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:40,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:40,152 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash -691997320, now seen corresponding path program 1 times [2020-10-20 01:45:40,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:40,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182966525] [2020-10-20 01:45:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:45:40,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182966525] [2020-10-20 01:45:40,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:45:40,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:45:40,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479639581] [2020-10-20 01:45:40,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:45:40,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:45:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:45:40,401 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-10-20 01:45:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:40,522 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-10-20 01:45:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:45:40,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-20 01:45:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:40,536 INFO L225 Difference]: With dead ends: 32 [2020-10-20 01:45:40,537 INFO L226 Difference]: Without dead ends: 18 [2020-10-20 01:45:40,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:45:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-20 01:45:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 01:45:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 01:45:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-20 01:45:40,593 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-10-20 01:45:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:40,593 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-20 01:45:40,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:45:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-20 01:45:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:45:40,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:40,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:40,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:45:40,603 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:40,605 INFO L82 PathProgramCache]: Analyzing trace with hash 717045018, now seen corresponding path program 1 times [2020-10-20 01:45:40,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:40,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381508283] [2020-10-20 01:45:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:45:40,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381508283] [2020-10-20 01:45:40,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:45:40,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:45:40,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904636467] [2020-10-20 01:45:40,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:45:40,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:40,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:45:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:45:40,727 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-10-20 01:45:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:40,801 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-20 01:45:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:45:40,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:45:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:40,803 INFO L225 Difference]: With dead ends: 24 [2020-10-20 01:45:40,803 INFO L226 Difference]: Without dead ends: 20 [2020-10-20 01:45:40,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:45:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-20 01:45:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-10-20 01:45:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 01:45:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-20 01:45:40,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-10-20 01:45:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:40,812 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-20 01:45:40,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:45:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-20 01:45:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 01:45:40,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:40,814 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:40,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:45:40,815 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1426922965, now seen corresponding path program 1 times [2020-10-20 01:45:40,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:40,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147713977] [2020-10-20 01:45:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 01:45:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:45:40,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147713977] [2020-10-20 01:45:40,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436333506] [2020-10-20 01:45:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:41,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:45:41,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:45:41,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:41,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-20 01:45:41,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725735401] [2020-10-20 01:45:41,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 01:45:41,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:41,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 01:45:41,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:45:41,182 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-10-20 01:45:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:41,314 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-10-20 01:45:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:45:41,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-20 01:45:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:41,316 INFO L225 Difference]: With dead ends: 35 [2020-10-20 01:45:41,316 INFO L226 Difference]: Without dead ends: 20 [2020-10-20 01:45:41,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:45:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-20 01:45:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 01:45:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 01:45:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-10-20 01:45:41,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-10-20 01:45:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:41,324 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-20 01:45:41,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 01:45:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-10-20 01:45:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 01:45:41,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:41,326 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:41,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-20 01:45:41,541 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 301752507, now seen corresponding path program 1 times [2020-10-20 01:45:41,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:41,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163335433] [2020-10-20 01:45:41,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:41,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:41,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:41,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:45:41,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163335433] [2020-10-20 01:45:41,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129117671] [2020-10-20 01:45:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:41,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:45:41,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:45:41,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:41,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 01:45:41,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742852335] [2020-10-20 01:45:41,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:45:41,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:45:41,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:45:41,796 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-10-20 01:45:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:41,901 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-10-20 01:45:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:45:41,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-20 01:45:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:41,904 INFO L225 Difference]: With dead ends: 38 [2020-10-20 01:45:41,905 INFO L226 Difference]: Without dead ends: 34 [2020-10-20 01:45:41,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:45:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-20 01:45:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-20 01:45:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 01:45:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-10-20 01:45:41,916 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-10-20 01:45:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:41,917 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-10-20 01:45:41,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:45:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-10-20 01:45:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:45:41,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:41,920 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:42,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:42,134 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:42,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1093063438, now seen corresponding path program 2 times [2020-10-20 01:45:42,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:42,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736996704] [2020-10-20 01:45:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:42,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:42,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:42,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:42,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:42,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-20 01:45:42,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736996704] [2020-10-20 01:45:42,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080851286] [2020-10-20 01:45:42,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:42,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 01:45:42,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:45:42,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:45:42,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 01:45:42,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:42,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-20 01:45:42,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288711333] [2020-10-20 01:45:42,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 01:45:42,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:42,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 01:45:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:45:42,462 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-10-20 01:45:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:42,728 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2020-10-20 01:45:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 01:45:42,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-10-20 01:45:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:42,731 INFO L225 Difference]: With dead ends: 68 [2020-10-20 01:45:42,731 INFO L226 Difference]: Without dead ends: 35 [2020-10-20 01:45:42,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:45:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-20 01:45:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-20 01:45:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 01:45:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-10-20 01:45:42,750 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2020-10-20 01:45:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:42,751 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-10-20 01:45:42,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 01:45:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-10-20 01:45:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 01:45:42,754 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:42,754 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:42,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:42,968 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1356719978, now seen corresponding path program 3 times [2020-10-20 01:45:42,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:42,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496761902] [2020-10-20 01:45:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-20 01:45:43,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496761902] [2020-10-20 01:45:43,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297224121] [2020-10-20 01:45:43,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:43,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 01:45:43,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:45:43,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:45:43,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-10-20 01:45:43,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:43,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-10-20 01:45:43,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904299673] [2020-10-20 01:45:43,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 01:45:43,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 01:45:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:45:43,340 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 10 states. [2020-10-20 01:45:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:43,543 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2020-10-20 01:45:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 01:45:43,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-10-20 01:45:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:43,549 INFO L225 Difference]: With dead ends: 84 [2020-10-20 01:45:43,549 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 01:45:43,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:45:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 01:45:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-10-20 01:45:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 01:45:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2020-10-20 01:45:43,575 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2020-10-20 01:45:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:43,575 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-10-20 01:45:43,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 01:45:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2020-10-20 01:45:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-20 01:45:43,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:43,586 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:43,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:43,802 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash 876254947, now seen corresponding path program 4 times [2020-10-20 01:45:43,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:43,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69734301] [2020-10-20 01:45:43,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:43,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:45:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-20 01:45:44,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69734301] [2020-10-20 01:45:44,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074140274] [2020-10-20 01:45:44,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:44,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 01:45:44,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:45:44,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 01:45:44,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-20 01:45:44,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:44,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 01:45:44,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125257646] [2020-10-20 01:45:44,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 01:45:44,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 01:45:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:45:44,282 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 10 states. [2020-10-20 01:45:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:44,508 INFO L93 Difference]: Finished difference Result 114 states and 173 transitions. [2020-10-20 01:45:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 01:45:44,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2020-10-20 01:45:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:44,512 INFO L225 Difference]: With dead ends: 114 [2020-10-20 01:45:44,512 INFO L226 Difference]: Without dead ends: 110 [2020-10-20 01:45:44,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:45:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-20 01:45:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-20 01:45:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 01:45:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-10-20 01:45:44,534 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 106 [2020-10-20 01:45:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:44,534 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-10-20 01:45:44,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 01:45:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-10-20 01:45:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-20 01:45:44,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:44,539 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:44,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-20 01:45:44,755 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:44,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1600878918, now seen corresponding path program 5 times [2020-10-20 01:45:44,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:44,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825319074] [2020-10-20 01:45:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:44,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:45:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:45:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:45:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-10-20 01:45:45,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825319074] [2020-10-20 01:45:45,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364306388] [2020-10-20 01:45:45,446 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:45,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2020-10-20 01:45:45,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:45:45,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 01:45:45,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 620 proven. 476 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2020-10-20 01:45:45,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:45,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2020-10-20 01:45:45,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362448605] [2020-10-20 01:45:45,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-20 01:45:45,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 01:45:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-10-20 01:45:45,707 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 18 states. [2020-10-20 01:45:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:46,349 INFO L93 Difference]: Finished difference Result 187 states and 337 transitions. [2020-10-20 01:45:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-20 01:45:46,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2020-10-20 01:45:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:46,356 INFO L225 Difference]: With dead ends: 187 [2020-10-20 01:45:46,356 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 01:45:46,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2020-10-20 01:45:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 01:45:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2020-10-20 01:45:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-20 01:45:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2020-10-20 01:45:46,390 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 201 [2020-10-20 01:45:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:46,392 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2020-10-20 01:45:46,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-20 01:45:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2020-10-20 01:45:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-20 01:45:46,397 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:46,397 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:46,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:46,611 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1830568536, now seen corresponding path program 6 times [2020-10-20 01:45:46,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:46,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266058824] [2020-10-20 01:45:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:45:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:45:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-10-20 01:45:46,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266058824] [2020-10-20 01:45:46,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6044777] [2020-10-20 01:45:46,989 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:47,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2020-10-20 01:45:47,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:45:47,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:45:47,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-10-20 01:45:47,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:47,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-10-20 01:45:47,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149736075] [2020-10-20 01:45:47,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 01:45:47,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 01:45:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:45:47,228 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 11 states. [2020-10-20 01:45:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:47,413 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2020-10-20 01:45:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 01:45:47,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2020-10-20 01:45:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:47,416 INFO L225 Difference]: With dead ends: 82 [2020-10-20 01:45:47,416 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 01:45:47,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-10-20 01:45:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 01:45:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-20 01:45:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 01:45:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2020-10-20 01:45:47,428 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 174 [2020-10-20 01:45:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:47,429 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2020-10-20 01:45:47,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 01:45:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2020-10-20 01:45:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-10-20 01:45:47,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:47,434 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:47,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:47,648 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 267357610, now seen corresponding path program 7 times [2020-10-20 01:45:47,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:47,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861272588] [2020-10-20 01:45:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:45:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:47,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:45:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:45:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-20 01:45:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:45:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:45:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:45:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:45:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:45:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-10-20 01:45:48,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861272588] [2020-10-20 01:45:48,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927480381] [2020-10-20 01:45:48,283 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:45:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:45:48,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 01:45:48,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:45:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-10-20 01:45:48,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:45:48,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 01:45:48,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390511545] [2020-10-20 01:45:48,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 01:45:48,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:45:48,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 01:45:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:45:48,537 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 12 states. [2020-10-20 01:45:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:45:48,816 INFO L93 Difference]: Finished difference Result 260 states and 386 transitions. [2020-10-20 01:45:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 01:45:48,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 283 [2020-10-20 01:45:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:45:48,821 INFO L225 Difference]: With dead ends: 260 [2020-10-20 01:45:48,821 INFO L226 Difference]: Without dead ends: 256 [2020-10-20 01:45:48,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:45:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-20 01:45:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2020-10-20 01:45:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-20 01:45:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2020-10-20 01:45:48,854 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 358 transitions. Word has length 283 [2020-10-20 01:45:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:45:48,855 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-10-20 01:45:48,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 01:45:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 358 transitions. [2020-10-20 01:45:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-10-20 01:45:48,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:45:48,865 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:45:49,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 01:45:49,079 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:45:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:45:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1142305995, now seen corresponding path program 8 times [2020-10-20 01:45:49,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:45:49,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566640043] [2020-10-20 01:45:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:45:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:45:49,164 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:45:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:45:49,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:45:49,446 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:45:49,447 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:45:49,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:45:49,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:45:49 BoogieIcfgContainer [2020-10-20 01:45:49,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:45:49,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:45:49,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:45:49,617 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:45:49,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:45:40" (3/4) ... [2020-10-20 01:45:49,620 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:45:49,759 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:45:49,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:45:49,761 INFO L168 Benchmark]: Toolchain (without parser) took 10333.44 ms. Allocated memory was 37.2 MB in the beginning and 127.4 MB in the end (delta: 90.2 MB). Free memory was 13.2 MB in the beginning and 28.5 MB in the end (delta: -15.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,762 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 37.2 MB. Free memory is still 16.6 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 01:45:49,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.51 ms. Allocated memory was 37.2 MB in the beginning and 44.0 MB in the end (delta: 6.8 MB). Free memory was 12.4 MB in the beginning and 28.2 MB in the end (delta: -15.8 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.84 ms. Allocated memory is still 44.0 MB. Free memory was 28.2 MB in the beginning and 26.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,764 INFO L168 Benchmark]: Boogie Preprocessor took 17.63 ms. Allocated memory is still 44.0 MB. Free memory was 26.6 MB in the beginning and 25.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,764 INFO L168 Benchmark]: RCFGBuilder took 258.48 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 25.4 MB in the beginning and 27.2 MB in the end (delta: -1.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,765 INFO L168 Benchmark]: TraceAbstraction took 9543.30 ms. Allocated memory was 46.1 MB in the beginning and 127.4 MB in the end (delta: 81.3 MB). Free memory was 26.7 MB in the beginning and 53.0 MB in the end (delta: -26.3 MB). Peak memory consumption was 102.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,765 INFO L168 Benchmark]: Witness Printer took 142.47 ms. Allocated memory is still 127.4 MB. Free memory was 53.0 MB in the beginning and 28.5 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:45:49,768 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.32 ms. Allocated memory is still 37.2 MB. Free memory is still 16.6 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 330.51 ms. Allocated memory was 37.2 MB in the beginning and 44.0 MB in the end (delta: 6.8 MB). Free memory was 12.4 MB in the beginning and 28.2 MB in the end (delta: -15.8 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 30.84 ms. Allocated memory is still 44.0 MB. Free memory was 28.2 MB in the beginning and 26.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 17.63 ms. Allocated memory is still 44.0 MB. Free memory was 26.6 MB in the beginning and 25.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 258.48 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 25.4 MB in the beginning and 27.2 MB in the end (delta: -1.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 9543.30 ms. Allocated memory was 46.1 MB in the beginning and 127.4 MB in the end (delta: 81.3 MB). Free memory was 26.7 MB in the beginning and 53.0 MB in the end (delta: -26.3 MB). Peak memory consumption was 102.9 MB. Max. memory is 14.3 GB. * Witness Printer took 142.47 ms. Allocated memory is still 127.4 MB. Free memory was 53.0 MB in the beginning and 28.5 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.3s, OverallIterations: 11, TraceHistogramMax: 67, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 163 SDtfs, 429 SDslu, 448 SDs, 0 SdLazy, 1024 SolverSat, 366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 1178 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 43 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2307 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 503397 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2124 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 13801/18588 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! Received shutdown request...