./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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-simple/fibo_2calls_4-1.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ffdaeeffc8c5fdb555812137dbba1199bd1a626d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:58:10,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:58:10,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:58:10,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:58:10,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:58:10,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:58:10,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:58:10,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:58:10,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:58:10,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:58:10,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:58:10,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:58:10,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:58:10,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:58:10,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:58:10,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:58:10,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:58:10,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:58:10,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:58:10,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:58:10,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:58:10,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:58:10,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:58:10,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:58:10,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:58:10,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:58:10,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:58:10,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:58:10,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:58:10,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:58:10,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:58:10,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:58:10,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:58:10,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:58:10,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:58:10,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:58:10,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:58:10,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:58:10,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:58:10,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:58:10,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:58:10,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:58:10,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:58:10,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:58:10,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:58:10,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:58:10,666 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:58:10,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:58:10,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:58:10,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:58:10,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:58:10,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:58:10,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:58:10,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:58:10,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:58:10,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:58:10,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:58:10,669 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:58:10,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:58:10,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:58:10,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:58:10,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:58:10,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:58:10,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:58:10,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:58:10,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:58:10,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:58:10,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:58:10,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:58:10,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:58:10,672 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(__VERIFIER_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 -> ffdaeeffc8c5fdb555812137dbba1199bd1a626d [2019-11-19 18:58:10,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:58:10,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:58:10,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:58:10,992 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:58:10,992 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:58:10,993 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2019-11-19 18:58:11,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e91dfc11/ebce7e984add48b0a29df97890fbe79e/FLAG1f554b30c [2019-11-19 18:58:11,499 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:58:11,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2019-11-19 18:58:11,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e91dfc11/ebce7e984add48b0a29df97890fbe79e/FLAG1f554b30c [2019-11-19 18:58:11,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e91dfc11/ebce7e984add48b0a29df97890fbe79e [2019-11-19 18:58:11,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:58:11,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:58:11,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:11,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:58:11,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:58:11,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:11" (1/1) ... [2019-11-19 18:58:11,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564d953c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:11, skipping insertion in model container [2019-11-19 18:58:11,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:11" (1/1) ... [2019-11-19 18:58:11,890 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:58:11,906 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:58:12,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:12,116 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:58:12,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:12,153 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:58:12,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12 WrapperNode [2019-11-19 18:58:12,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:12,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:12,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:58:12,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:58:12,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:12,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:58:12,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:58:12,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:58:12,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:58:12,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:58:12,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:58:12,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:58:12,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (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 [2019-11-19 18:58:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:58:12,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:58:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-19 18:58:12,317 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-19 18:58:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-19 18:58:12,319 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-19 18:58:12,522 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:58:12,522 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 18:58:12,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:12 BoogieIcfgContainer [2019-11-19 18:58:12,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:58:12,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:58:12,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:58:12,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:58:12,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:58:11" (1/3) ... [2019-11-19 18:58:12,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad38698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:12, skipping insertion in model container [2019-11-19 18:58:12,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (2/3) ... [2019-11-19 18:58:12,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad38698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:12, skipping insertion in model container [2019-11-19 18:58:12,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:12" (3/3) ... [2019-11-19 18:58:12,548 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2019-11-19 18:58:12,562 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:58:12,583 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:58:12,602 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:58:12,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:58:12,636 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:58:12,636 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:58:12,637 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:58:12,637 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:58:12,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:58:12,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:58:12,637 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:58:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-19 18:58:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 18:58:12,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:12,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:12,666 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-19 18:58:12,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:12,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683174660] [2019-11-19 18:58:12,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:58:12,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683174660] [2019-11-19 18:58:12,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:12,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:58:12,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880177854] [2019-11-19 18:58:12,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:58:12,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:12,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:58:12,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:58:12,899 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-19 18:58:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:13,007 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-19 18:58:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:13,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-19 18:58:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:13,019 INFO L225 Difference]: With dead ends: 38 [2019-11-19 18:58:13,019 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 18:58:13,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:58:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 18:58:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 18:58:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:58:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 18:58:13,064 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-19 18:58:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:13,064 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 18:58:13,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:58:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-19 18:58:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 18:58:13,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:13,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:13,067 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-19 18:58:13,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:13,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707510745] [2019-11-19 18:58:13,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:58:13,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707510745] [2019-11-19 18:58:13,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:13,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:58:13,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284763955] [2019-11-19 18:58:13,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:58:13,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:58:13,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:58:13,133 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-19 18:58:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:13,214 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-19 18:58:13,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:13,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-19 18:58:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:13,218 INFO L225 Difference]: With dead ends: 32 [2019-11-19 18:58:13,218 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 18:58:13,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:58:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 18:58:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-19 18:58:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:58:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 18:58:13,233 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-19 18:58:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:13,234 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 18:58:13,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:58:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-19 18:58:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:58:13,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:13,236 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:13,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-19 18:58:13,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:13,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526195728] [2019-11-19 18:58:13,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:13,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526195728] [2019-11-19 18:58:13,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114933114] [2019-11-19 18:58:13,393 INFO L94 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 [2019-11-19 18:58:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:13,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:13,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:13,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-19 18:58:13,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303517786] [2019-11-19 18:58:13,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:58:13,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:58:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:58:13,518 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-19 18:58:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:13,660 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-19 18:58:13,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:58:13,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-19 18:58:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:13,663 INFO L225 Difference]: With dead ends: 59 [2019-11-19 18:58:13,663 INFO L226 Difference]: Without dead ends: 35 [2019-11-19 18:58:13,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:58:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-19 18:58:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-19 18:58:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 18:58:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-19 18:58:13,674 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-19 18:58:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:13,675 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-19 18:58:13,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:58:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-19 18:58:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 18:58:13,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:13,677 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:13,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:13,885 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-19 18:58:13,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:13,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434505603] [2019-11-19 18:58:13,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:14,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434505603] [2019-11-19 18:58:14,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708212124] [2019-11-19 18:58:14,021 INFO L94 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 [2019-11-19 18:58:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:14,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:14,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:14,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-19 18:58:14,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013970720] [2019-11-19 18:58:14,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:58:14,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:58:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:58:14,119 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-19 18:58:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:14,302 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-19 18:58:14,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:58:14,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-19 18:58:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:14,306 INFO L225 Difference]: With dead ends: 55 [2019-11-19 18:58:14,307 INFO L226 Difference]: Without dead ends: 51 [2019-11-19 18:58:14,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:58:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-19 18:58:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-19 18:58:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 18:58:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-19 18:58:14,321 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-19 18:58:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:14,321 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-19 18:58:14,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:58:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-19 18:58:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 18:58:14,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:14,325 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:14,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:14,527 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-19 18:58:14,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:14,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874166631] [2019-11-19 18:58:14,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 18:58:14,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874166631] [2019-11-19 18:58:14,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691013204] [2019-11-19 18:58:14,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-19 18:58:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:14,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 18:58:14,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:14,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-19 18:58:14,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974229485] [2019-11-19 18:58:14,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:58:14,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:58:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:58:14,803 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-19 18:58:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:15,148 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-19 18:58:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 18:58:15,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-19 18:58:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:15,152 INFO L225 Difference]: With dead ends: 114 [2019-11-19 18:58:15,152 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 18:58:15,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:58:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 18:58:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-19 18:58:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 18:58:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-19 18:58:15,189 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-19 18:58:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:15,194 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-19 18:58:15,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:58:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-19 18:58:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 18:58:15,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:15,200 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:15,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:15,405 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:15,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-19 18:58:15,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:15,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59624563] [2019-11-19 18:58:15,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 18:58:15,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59624563] [2019-11-19 18:58:15,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144024937] [2019-11-19 18:58:15,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-19 18:58:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:15,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 18:58:15,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:15,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-19 18:58:15,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764059194] [2019-11-19 18:58:15,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:58:15,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:58:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:58:15,692 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-19 18:58:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:15,932 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-19 18:58:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:58:15,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-19 18:58:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:15,935 INFO L225 Difference]: With dead ends: 147 [2019-11-19 18:58:15,935 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 18:58:15,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-19 18:58:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 18:58:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-19 18:58:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 18:58:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-19 18:58:15,951 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-19 18:58:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:15,952 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-19 18:58:15,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:58:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-19 18:58:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:15,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:15,955 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:16,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:16,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-19 18:58:16,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:16,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699482358] [2019-11-19 18:58:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-19 18:58:16,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699482358] [2019-11-19 18:58:16,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769384238] [2019-11-19 18:58:16,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-19 18:58:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:16,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 18:58:16,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:16,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2019-11-19 18:58:16,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566966217] [2019-11-19 18:58:16,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 18:58:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 18:58:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-19 18:58:16,548 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 15 states. [2019-11-19 18:58:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:16,911 INFO L93 Difference]: Finished difference Result 163 states and 263 transitions. [2019-11-19 18:58:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 18:58:16,911 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-19 18:58:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:16,913 INFO L225 Difference]: With dead ends: 163 [2019-11-19 18:58:16,913 INFO L226 Difference]: Without dead ends: 99 [2019-11-19 18:58:16,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-19 18:58:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2019-11-19 18:58:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-19 18:58:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2019-11-19 18:58:16,940 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 50 [2019-11-19 18:58:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:16,941 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2019-11-19 18:58:16,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 18:58:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2019-11-19 18:58:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 18:58:16,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:16,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:17,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:17,153 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -751947822, now seen corresponding path program 1 times [2019-11-19 18:58:17,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:17,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428438191] [2019-11-19 18:58:17,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-19 18:58:17,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428438191] [2019-11-19 18:58:17,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741999459] [2019-11-19 18:58:17,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-19 18:58:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:17,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 18:58:17,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:17,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-11-19 18:58:17,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819189669] [2019-11-19 18:58:17,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 18:58:17,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 18:58:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-19 18:58:17,433 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand 15 states. [2019-11-19 18:58:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:17,809 INFO L93 Difference]: Finished difference Result 182 states and 293 transitions. [2019-11-19 18:58:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 18:58:17,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-19 18:58:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:17,811 INFO L225 Difference]: With dead ends: 182 [2019-11-19 18:58:17,812 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 18:58:17,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:58:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 18:58:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-11-19 18:58:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 18:58:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2019-11-19 18:58:17,825 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 51 [2019-11-19 18:58:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:17,825 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2019-11-19 18:58:17,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 18:58:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2019-11-19 18:58:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 18:58:17,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:17,828 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:18,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:18,032 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1674024370, now seen corresponding path program 2 times [2019-11-19 18:58:18,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:18,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347928534] [2019-11-19 18:58:18,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 36 proven. 41 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-19 18:58:18,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347928534] [2019-11-19 18:58:18,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017055554] [2019-11-19 18:58:18,320 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-19 18:58:18,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:18,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:18,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 18:58:18,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-19 18:58:18,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:18,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 22 [2019-11-19 18:58:18,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316664004] [2019-11-19 18:58:18,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 18:58:18,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 18:58:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-11-19 18:58:18,490 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand 22 states. [2019-11-19 18:58:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:19,308 INFO L93 Difference]: Finished difference Result 193 states and 345 transitions. [2019-11-19 18:58:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 18:58:19,309 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-11-19 18:58:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:19,311 INFO L225 Difference]: With dead ends: 193 [2019-11-19 18:58:19,312 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 18:58:19,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2019-11-19 18:58:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 18:58:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-19 18:58:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 18:58:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2019-11-19 18:58:19,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 77 [2019-11-19 18:58:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:19,324 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2019-11-19 18:58:19,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 18:58:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2019-11-19 18:58:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 18:58:19,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:19,326 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:19,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:19,548 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:19,548 INFO L82 PathProgramCache]: Analyzing trace with hash -26046796, now seen corresponding path program 1 times [2019-11-19 18:58:19,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:19,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095930186] [2019-11-19 18:58:19,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-19 18:58:19,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095930186] [2019-11-19 18:58:19,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343960681] [2019-11-19 18:58:19,869 INFO L94 rtionOrderModulation]: Keeping assertion order 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 [2019-11-19 18:58:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-19 18:58:19,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-19 18:58:20,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:20,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2019-11-19 18:58:20,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737890225] [2019-11-19 18:58:20,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 18:58:20,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 18:58:20,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:20,126 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 21 states. [2019-11-19 18:58:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:20,271 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-11-19 18:58:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 18:58:20,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-11-19 18:58:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:20,273 INFO L225 Difference]: With dead ends: 87 [2019-11-19 18:58:20,273 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 18:58:20,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 18:58:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-11-19 18:58:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 18:58:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2019-11-19 18:58:20,289 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 64 [2019-11-19 18:58:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:20,292 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2019-11-19 18:58:20,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 18:58:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2019-11-19 18:58:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 18:58:20,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:20,295 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:20,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:20,501 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1985146669, now seen corresponding path program 1 times [2019-11-19 18:58:20,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:20,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382069358] [2019-11-19 18:58:20,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-19 18:58:20,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382069358] [2019-11-19 18:58:20,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145885212] [2019-11-19 18:58:20,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 18:58:20,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-19 18:58:20,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:20,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2019-11-19 18:58:20,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228707767] [2019-11-19 18:58:20,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 18:58:20,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 18:58:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-19 18:58:20,839 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 17 states. [2019-11-19 18:58:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:21,023 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2019-11-19 18:58:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 18:58:21,024 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-11-19 18:58:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:21,025 INFO L225 Difference]: With dead ends: 132 [2019-11-19 18:58:21,025 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:58:21,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-19 18:58:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:58:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:58:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:58:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:58:21,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-19 18:58:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:21,027 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:58:21,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 18:58:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:58:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:58:21,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:21,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:58:21,605 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 13 [2019-11-19 18:58:21,758 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2019-11-19 18:58:21,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:58:21,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:58:21,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:58:21,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-19 18:58:21,762 INFO L440 ceAbstractionStarter]: At program point L41(lines 35 42) the Hoare annotation is: (<= 4 ULTIMATE.start_main_~x~0) [2019-11-19 18:58:21,762 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-19 18:58:21,763 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-19 18:58:21,764 INFO L440 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 4) (<= 4 ULTIMATE.start_main_~x~0)) [2019-11-19 18:58:21,764 INFO L444 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-19 18:58:21,764 INFO L444 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-19 18:58:21,765 INFO L447 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-19 18:58:21,765 INFO L440 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (not (<= |fibo2_#in~n| 1)) (= fibo2_~n |fibo2_#in~n|)) [2019-11-19 18:58:21,765 INFO L444 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-19 18:58:21,765 INFO L440 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (or (<= 4 fibo2_~n) (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1))) (= fibo2_~n |fibo2_#in~n|)) [2019-11-19 18:58:21,766 INFO L444 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-19 18:58:21,766 INFO L444 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-19 18:58:21,766 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-19 18:58:21,766 INFO L444 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-19 18:58:21,767 INFO L444 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-19 18:58:21,767 INFO L447 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-19 18:58:21,767 INFO L440 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2019-11-19 18:58:21,768 INFO L444 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-19 18:58:21,768 INFO L440 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (or (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 4 fibo1_~n)) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1)) (<= 5 |fibo1_#in~n|)) (= fibo1_~n |fibo1_#in~n|)) [2019-11-19 18:58:21,768 INFO L444 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-19 18:58:21,768 INFO L444 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-19 18:58:21,769 INFO L444 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-19 18:58:21,769 INFO L444 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-19 18:58:21,769 INFO L444 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-19 18:58:21,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:58:21 BoogieIcfgContainer [2019-11-19 18:58:21,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:58:21,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:58:21,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:58:21,788 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:58:21,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:12" (3/4) ... [2019-11-19 18:58:21,793 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:58:21,800 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-19 18:58:21,801 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-19 18:58:21,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 18:58:21,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 18:58:21,879 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:58:21,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:58:21,884 INFO L168 Benchmark]: Toolchain (without parser) took 10011.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.2 MB). Free memory was 960.4 MB in the beginning and 933.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:21,886 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:21,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.43 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:21,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.35 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:21,889 INFO L168 Benchmark]: Boogie Preprocessor took 71.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:21,889 INFO L168 Benchmark]: RCFGBuilder took 265.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:21,890 INFO L168 Benchmark]: TraceAbstraction took 9250.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 933.0 MB in the end (delta: 187.4 MB). Peak memory consumption was 328.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:21,890 INFO L168 Benchmark]: Witness Printer took 93.05 ms. Allocated memory is still 1.3 GB. Free memory was 933.0 MB in the beginning and 933.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-19 18:58:21,892 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.43 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.35 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9250.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 933.0 MB in the end (delta: 187.4 MB). Peak memory consumption was 328.9 MB. Max. memory is 11.5 GB. * Witness Printer took 93.05 ms. Allocated memory is still 1.3 GB. Free memory was 933.0 MB in the beginning and 933.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 4 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 275 SDtfs, 401 SDslu, 1859 SDs, 0 SdLazy, 2338 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 537 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=7, 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, 11 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 311 PreInvPairs, 397 NumberOfFragments, 78 HoareAnnotationTreeSize, 311 FomulaSimplifications, 1134 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1164 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 114027 SizeOfPredicates, 31 NumberOfNonLiveVariables, 986 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 686/962 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...