./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_6-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 595c6555624af5bbcf79585a20acb2500e3eeee8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:17,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:17,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:17,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:17,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:17,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:17,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:17,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:17,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:17,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:17,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:17,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:17,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:17,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:17,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:17,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:17,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:17,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:17,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:17,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:17,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:17,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:17,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:17,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:17,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:17,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:17,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:17,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:17,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:17,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:17,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:17,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:17,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:17,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:17,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:17,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:17,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:17,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:17,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:17,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:17,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:17,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:17,536 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:17,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:17,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:17,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:17,541 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:17,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:17,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:17,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:17,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:17,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:17,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:17,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:17,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:17,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:17,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:17,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:17,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:17,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:17,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:17,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:17,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:17,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:17,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:17,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:17,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:17,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:17,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:17,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:17,555 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 -> 595c6555624af5bbcf79585a20acb2500e3eeee8 [2019-11-28 00:25:17,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:17,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:17,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:17,987 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:17,987 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:17,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2019-11-28 00:25:18,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bfa7759/af64d95229304e92b029432a460dec13/FLAG232d33f56 [2019-11-28 00:25:18,528 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:18,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2019-11-28 00:25:18,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bfa7759/af64d95229304e92b029432a460dec13/FLAG232d33f56 [2019-11-28 00:25:18,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bfa7759/af64d95229304e92b029432a460dec13 [2019-11-28 00:25:18,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:18,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:18,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:18,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:18,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:18,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:18" (1/1) ... [2019-11-28 00:25:18,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:18, skipping insertion in model container [2019-11-28 00:25:18,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:18" (1/1) ... [2019-11-28 00:25:18,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:18,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:19,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:19,216 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:19,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:19,253 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:19,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19 WrapperNode [2019-11-28 00:25:19,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:19,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:19,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:19,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:19,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:19,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:19,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:19,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:19,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (1/1) ... [2019-11-28 00:25:19,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:19,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:19,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:19,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:19,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (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-28 00:25:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:19,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 00:25:19,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 00:25:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 00:25:19,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 00:25:19,647 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:19,647 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:19,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:19 BoogieIcfgContainer [2019-11-28 00:25:19,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:19,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:19,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:19,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:19,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:18" (1/3) ... [2019-11-28 00:25:19,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e939c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:19, skipping insertion in model container [2019-11-28 00:25:19,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:19" (2/3) ... [2019-11-28 00:25:19,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e939c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:19, skipping insertion in model container [2019-11-28 00:25:19,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:19" (3/3) ... [2019-11-28 00:25:19,668 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2019-11-28 00:25:19,687 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:19,696 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:19,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:19,757 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:19,758 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:19,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:19,759 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:19,759 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:19,759 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:19,759 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:19,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 00:25:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:19,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:19,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:19,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 00:25:19,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:19,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4969987] [2019-11-28 00:25:19,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:19,996 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-28 00:25:19,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4969987] [2019-11-28 00:25:19,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:19,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:20,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271576162] [2019-11-28 00:25:20,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:20,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:20,019 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-28 00:25:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:20,135 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 00:25:20,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:20,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:25:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:20,146 INFO L225 Difference]: With dead ends: 38 [2019-11-28 00:25:20,146 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:20,149 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-28 00:25:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:20,190 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 00:25:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:20,191 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:20,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:25:20,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:20,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:20,194 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 00:25:20,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:20,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993002258] [2019-11-28 00:25:20,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,255 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-28 00:25:20,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993002258] [2019-11-28 00:25:20,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:20,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:20,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391571769] [2019-11-28 00:25:20,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:20,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:20,260 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-28 00:25:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:20,334 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 00:25:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:20,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:25:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:20,336 INFO L225 Difference]: With dead ends: 32 [2019-11-28 00:25:20,336 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:25:20,338 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-28 00:25:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:25:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:25:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:20,347 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 00:25:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:20,348 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:20,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:25:20,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:20,350 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-28 00:25:20,350 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 00:25:20,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:20,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143330183] [2019-11-28 00:25:20,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,552 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-28 00:25:20,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143330183] [2019-11-28 00:25:20,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296679684] [2019-11-28 00:25:20,558 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-28 00:25:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:20,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:20,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:20,713 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-28 00:25:20,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:20,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 00:25:20,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328293755] [2019-11-28 00:25:20,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:20,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:20,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:20,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:20,720 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-28 00:25:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:20,885 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 00:25:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:20,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 00:25:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:20,887 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:25:20,888 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:20,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 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-28 00:25:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 00:25:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:25:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 00:25:20,899 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 00:25:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:20,900 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 00:25:20,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 00:25:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:20,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:20,902 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-28 00:25:21,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:21,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 00:25:21,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:21,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132173215] [2019-11-28 00:25:21,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,258 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-28 00:25:21,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132173215] [2019-11-28 00:25:21,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322792301] [2019-11-28 00:25:21,259 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) [2019-11-28 00:25:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:21,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:21,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:21,338 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-28 00:25:21,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:21,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 00:25:21,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700833946] [2019-11-28 00:25:21,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:21,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:21,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:21,341 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-28 00:25:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:21,600 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 00:25:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:21,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 00:25:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:21,608 INFO L225 Difference]: With dead ends: 55 [2019-11-28 00:25:21,608 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 00:25:21,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 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-28 00:25:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 00:25:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 00:25:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 00:25:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 00:25:21,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 00:25:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:21,637 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 00:25:21,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 00:25:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:25:21,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:21,644 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-28 00:25:21,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:21,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 00:25:21,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:21,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348305241] [2019-11-28 00:25:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,002 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-28 00:25:22,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348305241] [2019-11-28 00:25:22,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817293931] [2019-11-28 00:25:22,003 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-28 00:25:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:22,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:22,135 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-28 00:25:22,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:22,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 00:25:22,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974182912] [2019-11-28 00:25:22,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:22,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:22,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:22,142 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-28 00:25:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:22,467 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 00:25:22,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:25:22,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 00:25:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:22,471 INFO L225 Difference]: With dead ends: 114 [2019-11-28 00:25:22,471 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:25:22,473 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-28 00:25:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:25:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 00:25:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 00:25:22,502 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 00:25:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:22,502 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 00:25:22,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 00:25:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:25:22,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:22,508 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-28 00:25:22,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:22,719 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 00:25:22,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:22,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274399504] [2019-11-28 00:25:22,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,862 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-28 00:25:22,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274399504] [2019-11-28 00:25:22,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247445066] [2019-11-28 00:25:22,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 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-28 00:25:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:22,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:22,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:22,994 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-28 00:25:22,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:22,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-28 00:25:22,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057139775] [2019-11-28 00:25:22,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:22,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:22,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:22,996 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-28 00:25:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:23,283 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 00:25:23,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:23,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-28 00:25:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:23,286 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:25:23,288 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:25:23,295 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-28 00:25:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:25:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 00:25:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 00:25:23,327 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 00:25:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:23,329 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 00:25:23,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 00:25:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:25:23,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:23,339 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-28 00:25:23,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:23,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 00:25:23,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:23,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951654165] [2019-11-28 00:25:23,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,808 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-28 00:25:23,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951654165] [2019-11-28 00:25:23,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787146677] [2019-11-28 00:25:23,813 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-28 00:25:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:23,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:23,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:25:23,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:23,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-28 00:25:23,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355065414] [2019-11-28 00:25:23,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:25:23,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:25:23,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:23,948 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 16 states. [2019-11-28 00:25:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:24,455 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-28 00:25:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:25:24,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-28 00:25:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:24,459 INFO L225 Difference]: With dead ends: 164 [2019-11-28 00:25:24,459 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 00:25:24,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:25:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 00:25:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-28 00:25:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:25:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-28 00:25:24,479 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-28 00:25:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:24,480 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-28 00:25:24,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:25:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-28 00:25:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 00:25:24,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:24,484 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:24,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:24,691 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-28 00:25:24,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:24,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830964363] [2019-11-28 00:25:24,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 00:25:25,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830964363] [2019-11-28 00:25:25,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284063459] [2019-11-28 00:25:25,022 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-28 00:25:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:25,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:25,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-28 00:25:25,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:25,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-28 00:25:25,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969592029] [2019-11-28 00:25:25,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:25:25,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:25,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:25:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:25,191 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 18 states. [2019-11-28 00:25:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:25,770 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-28 00:25:25,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:25:25,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-11-28 00:25:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:25,774 INFO L225 Difference]: With dead ends: 207 [2019-11-28 00:25:25,774 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 00:25:25,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:25:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 00:25:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-28 00:25:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 00:25:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-28 00:25:25,791 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-28 00:25:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:25,792 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-28 00:25:25,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:25:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-28 00:25:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 00:25:25,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:25,795 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:26,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:26,007 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-28 00:25:26,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:26,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953626245] [2019-11-28 00:25:26,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-28 00:25:26,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953626245] [2019-11-28 00:25:26,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865817169] [2019-11-28 00:25:26,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-28 00:25:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:26,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:26,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-28 00:25:26,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:26,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2019-11-28 00:25:26,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081400261] [2019-11-28 00:25:26,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:25:26,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:25:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:26,510 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 18 states. [2019-11-28 00:25:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:26,950 INFO L93 Difference]: Finished difference Result 209 states and 348 transitions. [2019-11-28 00:25:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:25:26,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 119 [2019-11-28 00:25:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:26,953 INFO L225 Difference]: With dead ends: 209 [2019-11-28 00:25:26,954 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 00:25:26,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:25:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 00:25:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-11-28 00:25:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 00:25:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 175 transitions. [2019-11-28 00:25:26,972 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 175 transitions. Word has length 119 [2019-11-28 00:25:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:26,973 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 175 transitions. [2019-11-28 00:25:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:25:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 175 transitions. [2019-11-28 00:25:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-28 00:25:26,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:26,977 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:27,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:27,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1957575691, now seen corresponding path program 2 times [2019-11-28 00:25:27,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:27,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762073096] [2019-11-28 00:25:27,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 467 proven. 589 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-11-28 00:25:28,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762073096] [2019-11-28 00:25:28,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896043787] [2019-11-28 00:25:28,237 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 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-28 00:25:28,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:28,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:28,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 00:25:28,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 174 proven. 310 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-11-28 00:25:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 28 [2019-11-28 00:25:28,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128804142] [2019-11-28 00:25:28,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:25:28,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:28,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:25:28,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:28,552 INFO L87 Difference]: Start difference. First operand 111 states and 175 transitions. Second operand 28 states. [2019-11-28 00:25:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:29,569 INFO L93 Difference]: Finished difference Result 310 states and 603 transitions. [2019-11-28 00:25:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 00:25:29,570 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 268 [2019-11-28 00:25:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:29,573 INFO L225 Difference]: With dead ends: 310 [2019-11-28 00:25:29,573 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 00:25:29,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1329, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 00:25:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 00:25:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 112. [2019-11-28 00:25:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 00:25:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2019-11-28 00:25:29,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 268 [2019-11-28 00:25:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:29,594 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2019-11-28 00:25:29,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:25:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2019-11-28 00:25:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 00:25:29,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:29,598 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:29,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:29,812 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1502984625, now seen corresponding path program 3 times [2019-11-28 00:25:29,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:29,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004677760] [2019-11-28 00:25:29,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 289 proven. 362 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-11-28 00:25:30,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004677760] [2019-11-28 00:25:30,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413130612] [2019-11-28 00:25:30,627 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-28 00:25:30,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 00:25:30,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:30,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 00:25:30,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 661 proven. 42 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2019-11-28 00:25:30,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:30,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 34 [2019-11-28 00:25:30,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092413503] [2019-11-28 00:25:30,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 00:25:30,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 00:25:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 00:25:30,876 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand 34 states. [2019-11-28 00:25:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:31,780 INFO L93 Difference]: Finished difference Result 240 states and 403 transitions. [2019-11-28 00:25:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 00:25:31,780 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 214 [2019-11-28 00:25:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:31,782 INFO L225 Difference]: With dead ends: 240 [2019-11-28 00:25:31,783 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 00:25:31,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 00:25:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 00:25:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2019-11-28 00:25:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 00:25:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2019-11-28 00:25:31,799 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 214 [2019-11-28 00:25:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:31,802 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2019-11-28 00:25:31,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 00:25:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2019-11-28 00:25:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-28 00:25:31,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:31,807 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:32,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:32,011 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 634625338, now seen corresponding path program 4 times [2019-11-28 00:25:32,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:32,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465180968] [2019-11-28 00:25:32,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 131 proven. 3 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-11-28 00:25:32,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465180968] [2019-11-28 00:25:32,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307097678] [2019-11-28 00:25:32,276 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:32,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:32,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:32,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 00:25:32,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-28 00:25:32,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:25:32,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-11-28 00:25:32,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872021421] [2019-11-28 00:25:32,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:25:32,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:25:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:25:32,442 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand 6 states. [2019-11-28 00:25:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:32,515 INFO L93 Difference]: Finished difference Result 240 states and 329 transitions. [2019-11-28 00:25:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:25:32,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-11-28 00:25:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:32,518 INFO L225 Difference]: With dead ends: 240 [2019-11-28 00:25:32,519 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 00:25:32,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 00:25:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-11-28 00:25:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 00:25:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2019-11-28 00:25:32,535 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 172 [2019-11-28 00:25:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:32,536 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2019-11-28 00:25:32,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:25:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2019-11-28 00:25:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-28 00:25:32,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:32,540 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:32,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:32,745 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:32,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:32,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 5 times [2019-11-28 00:25:32,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:32,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864113538] [2019-11-28 00:25:32,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 145 proven. 138 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-28 00:25:33,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864113538] [2019-11-28 00:25:33,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904053084] [2019-11-28 00:25:33,197 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:33,260 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 00:25:33,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:33,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:25:33,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 150 proven. 142 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-28 00:25:33,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:33,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2019-11-28 00:25:33,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815080644] [2019-11-28 00:25:33,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:25:33,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:25:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:25:33,384 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 25 states. [2019-11-28 00:25:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:33,862 INFO L93 Difference]: Finished difference Result 244 states and 330 transitions. [2019-11-28 00:25:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:25:33,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-11-28 00:25:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:33,865 INFO L225 Difference]: With dead ends: 244 [2019-11-28 00:25:33,865 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 00:25:33,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:25:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 00:25:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-28 00:25:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 00:25:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2019-11-28 00:25:33,883 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 146 [2019-11-28 00:25:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:33,883 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2019-11-28 00:25:33,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:25:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2019-11-28 00:25:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 00:25:33,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:33,887 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:34,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:34,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 6 times [2019-11-28 00:25:34,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:34,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246241765] [2019-11-28 00:25:34,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 210 proven. 368 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-11-28 00:25:34,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246241765] [2019-11-28 00:25:34,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146659915] [2019-11-28 00:25:34,728 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:34,824 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 00:25:34,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:34,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:34,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 294 proven. 58 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2019-11-28 00:25:34,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:34,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 30 [2019-11-28 00:25:34,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125194714] [2019-11-28 00:25:34,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 00:25:34,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 00:25:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:25:34,971 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand 30 states. [2019-11-28 00:25:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:36,033 INFO L93 Difference]: Finished difference Result 281 states and 406 transitions. [2019-11-28 00:25:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-28 00:25:36,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 214 [2019-11-28 00:25:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:36,036 INFO L225 Difference]: With dead ends: 281 [2019-11-28 00:25:36,037 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 00:25:36,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=2192, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 00:25:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 00:25:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-28 00:25:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 00:25:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2019-11-28 00:25:36,053 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 214 [2019-11-28 00:25:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2019-11-28 00:25:36,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 00:25:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2019-11-28 00:25:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 00:25:36,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:36,056 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:36,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:36,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 7 times [2019-11-28 00:25:36,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:36,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510830174] [2019-11-28 00:25:36,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-11-28 00:25:37,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510830174] [2019-11-28 00:25:37,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735520747] [2019-11-28 00:25:37,204 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:37,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 103 conjunts are in the unsatisfiable core [2019-11-28 00:25:37,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-11-28 00:25:38,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:38,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2019-11-28 00:25:38,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172191324] [2019-11-28 00:25:38,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-28 00:25:38,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-28 00:25:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:38,087 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand 36 states. [2019-11-28 00:25:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,617 INFO L93 Difference]: Finished difference Result 150 states and 193 transitions. [2019-11-28 00:25:38,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 00:25:38,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 173 [2019-11-28 00:25:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,621 INFO L225 Difference]: With dead ends: 150 [2019-11-28 00:25:38,621 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 00:25:38,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 227 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 00:25:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-11-28 00:25:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 00:25:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 182 transitions. [2019-11-28 00:25:38,635 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 182 transitions. Word has length 173 [2019-11-28 00:25:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 182 transitions. [2019-11-28 00:25:38,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-28 00:25:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 182 transitions. [2019-11-28 00:25:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 00:25:38,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,639 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:38,844 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1640173863, now seen corresponding path program 8 times [2019-11-28 00:25:38,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933577099] [2019-11-28 00:25:38,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 201 proven. 323 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-11-28 00:25:39,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933577099] [2019-11-28 00:25:39,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127708211] [2019-11-28 00:25:39,508 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:39,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:39,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:39,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 00:25:39,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 111 proven. 313 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-11-28 00:25:39,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:39,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 25 [2019-11-28 00:25:39,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194421613] [2019-11-28 00:25:39,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:25:39,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:25:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:25:39,724 INFO L87 Difference]: Start difference. First operand 143 states and 182 transitions. Second operand 25 states. [2019-11-28 00:25:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:40,126 INFO L93 Difference]: Finished difference Result 263 states and 336 transitions. [2019-11-28 00:25:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:25:40,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2019-11-28 00:25:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:40,127 INFO L225 Difference]: With dead ends: 263 [2019-11-28 00:25:40,127 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:25:40,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:25:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:25:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:25:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:25:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:25:40,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2019-11-28 00:25:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:40,131 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:25:40,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:25:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:25:40,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:25:40,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:40,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:25:41,031 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2019-11-28 00:25:41,573 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 30 [2019-11-28 00:25:42,078 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 25 [2019-11-28 00:25:42,083 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:25:42,083 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:25:42,083 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:25:42,083 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 00:25:42,084 INFO L242 CegarLoopResult]: At program point L41(lines 35 42) the Hoare annotation is: (<= 6 ULTIMATE.start_main_~x~0) [2019-11-28 00:25:42,084 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 00:25:42,084 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-28 00:25:42,084 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6)) [2019-11-28 00:25:42,084 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 00:25:42,084 INFO L246 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-28 00:25:42,084 INFO L249 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-28 00:25:42,084 INFO L242 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (<= |fibo2_#in~n| 1)) (= fibo2_~n |fibo2_#in~n|)) [2019-11-28 00:25:42,085 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 00:25:42,085 INFO L242 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (and (<= fibo2_~n 2) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1) (<= 2 |fibo2_#in~n|)))) (and (or .cse0 (not (<= |fibo2_#in~n| 3))) (or (<= |fibo2_#in~n| 4) (<= 6 |fibo2_#in~n|) (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3))) (= fibo2_~n |fibo2_#in~n|) (or .cse0 (<= 5 fibo2_~n) (and (<= |fibo2_#t~ret2| 2) (<= 2 |fibo2_#t~ret2|))))) [2019-11-28 00:25:42,085 INFO L246 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-28 00:25:42,085 INFO L246 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-28 00:25:42,085 INFO L246 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-28 00:25:42,085 INFO L246 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-28 00:25:42,085 INFO L246 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-28 00:25:42,086 INFO L249 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-28 00:25:42,086 INFO L242 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 00:25:42,086 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-28 00:25:42,086 INFO L242 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1)) (not (<= |fibo1_#in~n| 4))) (or (<= |fibo1_#in~n| 5) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|))) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 00:25:42,086 INFO L246 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-28 00:25:42,086 INFO L246 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-28 00:25:42,086 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 00:25:42,086 INFO L246 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-28 00:25:42,087 INFO L246 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-28 00:25:42,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:25:42 BoogieIcfgContainer [2019-11-28 00:25:42,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:25:42,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:25:42,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:25:42,104 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:25:42,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:19" (3/4) ... [2019-11-28 00:25:42,108 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:25:42,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-28 00:25:42,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-28 00:25:42,119 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:25:42,119 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:25:42,165 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:25:42,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:25:42,168 INFO L168 Benchmark]: Toolchain (without parser) took 23223.78 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 599.8 MB). Free memory was 960.4 MB in the beginning and 1.5 GB in the end (delta: -580.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,168 INFO L168 Benchmark]: CDTParser took 0.48 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-28 00:25:42,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.61 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-28 00:25:42,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,170 INFO L168 Benchmark]: Boogie Preprocessor took 33.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,170 INFO L168 Benchmark]: RCFGBuilder took 257.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,171 INFO L168 Benchmark]: TraceAbstraction took 22450.08 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 479.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -461.1 MB). Peak memory consumption was 701.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,171 INFO L168 Benchmark]: Witness Printer took 62.29 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,174 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.48 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 308.61 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 103.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22450.08 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 479.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -461.1 MB). Peak memory consumption was 701.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.29 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. 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: 6 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 20.5s, OverallIterations: 16, TraceHistogramMax: 21, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 485 SDtfs, 848 SDslu, 4710 SDs, 0 SdLazy, 6598 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2648 GetRequests, 2269 SyntacticMatches, 19 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2714 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 155 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 701 PreInvPairs, 1173 NumberOfFragments, 124 HoareAnnotationTreeSize, 701 FomulaSimplifications, 9137 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 7447 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3573 NumberOfCodeBlocks, 3402 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3543 ConstructedInterpolants, 0 QuantifiedInterpolants, 1219797 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3572 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 13345/16956 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...