./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_4-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ffdaeeffc8c5fdb555812137dbba1199bd1a626d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:07,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:07,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:07,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:07,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:07,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:07,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:07,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:07,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:07,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:07,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:07,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:07,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:07,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:07,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:07,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:07,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:07,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:07,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:07,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:07,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:07,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:07,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:07,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:07,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:07,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:07,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:07,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:07,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:07,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:07,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:07,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:07,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:07,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:07,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:07,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:07,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:07,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:07,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:07,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:07,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:07,489 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:07,504 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:07,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:07,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:07,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:07,507 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:07,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:07,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:07,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:07,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:07,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:07,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:07,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:07,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:07,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:07,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:07,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:07,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:07,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:07,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:07,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:07,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:07,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:07,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:07,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:07,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:07,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:07,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:07,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:07,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffdaeeffc8c5fdb555812137dbba1199bd1a626d [2019-11-28 00:25:07,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:07,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:07,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:07,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:07,835 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:07,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2019-11-28 00:25:07,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70093bcaa/200363955c894175af6de510a6d8e19d/FLAG28b876fc9 [2019-11-28 00:25:08,391 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:08,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2019-11-28 00:25:08,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70093bcaa/200363955c894175af6de510a6d8e19d/FLAG28b876fc9 [2019-11-28 00:25:08,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70093bcaa/200363955c894175af6de510a6d8e19d [2019-11-28 00:25:08,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:08,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:08,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:08,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:08,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:08,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:08" (1/1) ... [2019-11-28 00:25:08,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ceee9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:08, skipping insertion in model container [2019-11-28 00:25:08,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:08" (1/1) ... [2019-11-28 00:25:08,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:08,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:09,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:09,076 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:09,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:09,111 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:09,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09 WrapperNode [2019-11-28 00:25:09,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:09,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:09,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:09,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:09,122 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:09" (1/1) ... [2019-11-28 00:25:09,127 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:09" (1/1) ... [2019-11-28 00:25:09,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:09,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:09,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:09,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:09,212 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:09" (1/1) ... [2019-11-28 00:25:09,213 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:09" (1/1) ... [2019-11-28 00:25:09,214 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:09" (1/1) ... [2019-11-28 00:25:09,214 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:09" (1/1) ... [2019-11-28 00:25:09,218 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:09" (1/1) ... [2019-11-28 00:25:09,221 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:09" (1/1) ... [2019-11-28 00:25:09,222 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:09" (1/1) ... [2019-11-28 00:25:09,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:09,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:09,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:09,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:09,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (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:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:09,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 00:25:09,291 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 00:25:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 00:25:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 00:25:09,485 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:09,485 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:09,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:09 BoogieIcfgContainer [2019-11-28 00:25:09,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:09,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:09,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:09,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:09,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:08" (1/3) ... [2019-11-28 00:25:09,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8427a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:09, skipping insertion in model container [2019-11-28 00:25:09,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:09" (2/3) ... [2019-11-28 00:25:09,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8427a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:09, skipping insertion in model container [2019-11-28 00:25:09,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:09" (3/3) ... [2019-11-28 00:25:09,509 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2019-11-28 00:25:09,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:09,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:09,574 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:09,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:09,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:09,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:09,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:09,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:09,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:09,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:09,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 00:25:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:09,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:09,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:09,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 00:25:09,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:09,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055703156] [2019-11-28 00:25:09,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:09,851 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:09,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055703156] [2019-11-28 00:25:09,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:09,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:09,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998597334] [2019-11-28 00:25:09,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:09,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:09,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:09,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:09,874 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-28 00:25:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:09,996 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 00:25:09,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:09,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:25:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:10,014 INFO L225 Difference]: With dead ends: 38 [2019-11-28 00:25:10,015 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:10,018 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:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:10,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 00:25:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:10,068 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:10,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:25:10,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:10,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:10,072 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 00:25:10,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:10,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656311473] [2019-11-28 00:25:10,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,132 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:10,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656311473] [2019-11-28 00:25:10,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:10,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:10,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204386073] [2019-11-28 00:25:10,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:10,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:10,138 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-28 00:25:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:10,211 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 00:25:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:10,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:25:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:10,213 INFO L225 Difference]: With dead ends: 32 [2019-11-28 00:25:10,214 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:25:10,215 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:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:25:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:25:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 00:25:10,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 00:25:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:10,225 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 00:25:10,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 00:25:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:25:10,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:10,227 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:10,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 00:25:10,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:10,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776425776] [2019-11-28 00:25:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,462 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:10,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776425776] [2019-11-28 00:25:10,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729573100] [2019-11-28 00:25:10,463 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:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:10,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:10,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:10,589 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:10,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:10,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 00:25:10,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611834378] [2019-11-28 00:25:10,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:10,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:10,591 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-28 00:25:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:10,774 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 00:25:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:10,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 00:25:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:10,777 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:25:10,777 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:10,778 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:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 00:25:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:25:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 00:25:10,788 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 00:25:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:10,789 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 00:25:10,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 00:25:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:10,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:10,791 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:11,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:11,005 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 00:25:11,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:11,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858994943] [2019-11-28 00:25:11,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,159 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:11,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858994943] [2019-11-28 00:25:11,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282141865] [2019-11-28 00:25:11,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:11,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:11,253 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:11,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:11,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 00:25:11,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697940218] [2019-11-28 00:25:11,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:11,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:11,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:11,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:11,256 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-28 00:25:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:11,489 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 00:25:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:11,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 00:25:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:11,496 INFO L225 Difference]: With dead ends: 55 [2019-11-28 00:25:11,500 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 00:25:11,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:25:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 00:25:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 00:25:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 00:25:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 00:25:11,529 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 00:25:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:11,530 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 00:25:11,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 00:25:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:25:11,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:11,538 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:11,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:11,743 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 00:25:11,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:11,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231463076] [2019-11-28 00:25:11,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,934 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:11,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231463076] [2019-11-28 00:25:11,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936580918] [2019-11-28 00:25:11,935 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:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:11,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:11,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:12,046 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:12,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:12,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 00:25:12,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912417960] [2019-11-28 00:25:12,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:12,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:12,049 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-28 00:25:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:12,519 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 00:25:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:25:12,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 00:25:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:12,523 INFO L225 Difference]: With dead ends: 114 [2019-11-28 00:25:12,523 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:25:12,525 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:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:25:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 00:25:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 00:25:12,553 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 00:25:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:12,557 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 00:25:12,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 00:25:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:25:12,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:12,560 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:12,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:12,767 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 00:25:12,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:12,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265557685] [2019-11-28 00:25:12,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,920 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:12,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265557685] [2019-11-28 00:25:12,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681857262] [2019-11-28 00:25:12,928 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:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:12,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:12,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:13,042 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:13,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:13,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-28 00:25:13,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433868495] [2019-11-28 00:25:13,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:13,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:13,051 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-28 00:25:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:13,342 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 00:25:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:13,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-28 00:25:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:13,346 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:25:13,346 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:25:13,348 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:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:25:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 00:25:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:25:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 00:25:13,363 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 00:25:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:13,364 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 00:25:13,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 00:25:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:25:13,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:13,367 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:13,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:13,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:13,574 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 00:25:13,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:13,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149537913] [2019-11-28 00:25:13,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,782 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:13,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149537913] [2019-11-28 00:25:13,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678507109] [2019-11-28 00:25:13,783 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:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:13,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:13,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 00:25:13,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:13,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2019-11-28 00:25:13,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721638343] [2019-11-28 00:25:13,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:25:13,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:13,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:25:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:25:13,892 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 15 states. [2019-11-28 00:25:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:14,307 INFO L93 Difference]: Finished difference Result 163 states and 263 transitions. [2019-11-28 00:25:14,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:25:14,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-28 00:25:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:14,311 INFO L225 Difference]: With dead ends: 163 [2019-11-28 00:25:14,312 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 00:25:14,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:25:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 00:25:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2019-11-28 00:25:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 00:25:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2019-11-28 00:25:14,331 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 50 [2019-11-28 00:25:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:14,332 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2019-11-28 00:25:14,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:25:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2019-11-28 00:25:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:25:14,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:14,335 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:14,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:14,541 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:14,541 INFO L82 PathProgramCache]: Analyzing trace with hash -751947822, now seen corresponding path program 1 times [2019-11-28 00:25:14,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:14,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97810385] [2019-11-28 00:25:14,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 00:25:14,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97810385] [2019-11-28 00:25:14,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671193413] [2019-11-28 00:25:14,751 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:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:14,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:14,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 00:25:14,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:14,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-11-28 00:25:14,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631965509] [2019-11-28 00:25:14,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:25:14,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:25:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:25:14,845 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand 15 states. [2019-11-28 00:25:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:15,228 INFO L93 Difference]: Finished difference Result 182 states and 293 transitions. [2019-11-28 00:25:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:25:15,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-28 00:25:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:15,231 INFO L225 Difference]: With dead ends: 182 [2019-11-28 00:25:15,231 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 00:25:15,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 00:25:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-11-28 00:25:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:25:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2019-11-28 00:25:15,247 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 51 [2019-11-28 00:25:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2019-11-28 00:25:15,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:25:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2019-11-28 00:25:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 00:25:15,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:15,250 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:15,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:15,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:15,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1674024370, now seen corresponding path program 2 times [2019-11-28 00:25:15,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:15,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237472915] [2019-11-28 00:25:15,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 36 proven. 41 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-28 00:25:15,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237472915] [2019-11-28 00:25:15,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398496453] [2019-11-28 00:25:15,702 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:15,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:15,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:15,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 00:25:15,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-28 00:25:15,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:15,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 22 [2019-11-28 00:25:15,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501570172] [2019-11-28 00:25:15,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:25:15,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:25:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:15,890 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand 22 states. [2019-11-28 00:25:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:16,586 INFO L93 Difference]: Finished difference Result 193 states and 345 transitions. [2019-11-28 00:25:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:25:16,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-11-28 00:25:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:16,603 INFO L225 Difference]: With dead ends: 193 [2019-11-28 00:25:16,603 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 00:25:16,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:25:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 00:25:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-28 00:25:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:25:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2019-11-28 00:25:16,618 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 77 [2019-11-28 00:25:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:16,619 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2019-11-28 00:25:16,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:25:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2019-11-28 00:25:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 00:25:16,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:16,621 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:16,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:16,827 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -26046796, now seen corresponding path program 1 times [2019-11-28 00:25:16,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:16,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963998808] [2019-11-28 00:25:16,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-28 00:25:17,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963998808] [2019-11-28 00:25:17,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106278472] [2019-11-28 00:25:17,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:17,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 00:25:17,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-28 00:25:17,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:17,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2019-11-28 00:25:17,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855982312] [2019-11-28 00:25:17,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:25:17,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:25:17,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:25:17,683 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 21 states. [2019-11-28 00:25:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:17,832 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-11-28 00:25:17,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:17,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-11-28 00:25:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:17,834 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:25:17,834 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:25:17,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:25:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:25:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-11-28 00:25:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 00:25:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2019-11-28 00:25:17,843 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 64 [2019-11-28 00:25:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:17,844 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2019-11-28 00:25:17,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:25:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2019-11-28 00:25:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 00:25:17,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:17,845 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:18,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:18,049 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1985146669, now seen corresponding path program 1 times [2019-11-28 00:25:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:18,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262012621] [2019-11-28 00:25:18,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-28 00:25:18,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262012621] [2019-11-28 00:25:18,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40736418] [2019-11-28 00:25:18,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:18,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 00:25:18,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-28 00:25:18,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:18,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2019-11-28 00:25:18,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156379822] [2019-11-28 00:25:18,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:25:18,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:18,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:25:18,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:18,431 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 17 states. [2019-11-28 00:25:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:18,592 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2019-11-28 00:25:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:25:18,592 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-11-28 00:25:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:18,593 INFO L225 Difference]: With dead ends: 132 [2019-11-28 00:25:18,593 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:25:18,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:25:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:25:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:25:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:25:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:25:18,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-28 00:25:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:18,595 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:25:18,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:25:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:25:18,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:25:18,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:18,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:25:19,185 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 13 [2019-11-28 00:25:19,343 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2019-11-28 00:25:19,349 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:25:19,349 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:25:19,349 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:25:19,350 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 00:25:19,350 INFO L242 CegarLoopResult]: At program point L41(lines 35 42) the Hoare annotation is: (<= 4 ULTIMATE.start_main_~x~0) [2019-11-28 00:25:19,350 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 00:25:19,350 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-28 00:25:19,350 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 4) (<= 4 ULTIMATE.start_main_~x~0)) [2019-11-28 00:25:19,350 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 00:25:19,350 INFO L246 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-28 00:25:19,350 INFO L249 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-28 00:25:19,351 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:19,351 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 00:25:19,351 INFO L242 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1)) (<= 4 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|)) [2019-11-28 00:25:19,351 INFO L246 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-28 00:25:19,351 INFO L246 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-28 00:25:19,351 INFO L246 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-28 00:25:19,351 INFO L246 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-28 00:25:19,352 INFO L246 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-28 00:25:19,352 INFO L249 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-28 00:25:19,352 INFO L242 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 00:25:19,352 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-28 00:25:19,352 INFO L242 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (or (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1)) (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 4 fibo1_~n)) (<= 5 |fibo1_#in~n|)) (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 00:25:19,353 INFO L246 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-28 00:25:19,353 INFO L246 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-28 00:25:19,353 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 00:25:19,353 INFO L246 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-28 00:25:19,353 INFO L246 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-28 00:25:19,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:25:19 BoogieIcfgContainer [2019-11-28 00:25:19,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:25:19,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:25:19,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:25:19,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:25:19,370 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:09" (3/4) ... [2019-11-28 00:25:19,373 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:25:19,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-28 00:25:19,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-28 00:25:19,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:25:19,384 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:25:19,434 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:25:19,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:25:19,436 INFO L168 Benchmark]: Toolchain (without parser) took 10635.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 953.7 MB in the beginning and 897.5 MB in the end (delta: 56.1 MB). Peak memory consumption was 331.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:19,436 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:25:19,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.86 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 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:19,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:19,439 INFO L168 Benchmark]: Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:19,439 INFO L168 Benchmark]: RCFGBuilder took 264.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:19,440 INFO L168 Benchmark]: TraceAbstraction took 9878.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 906.2 MB in the end (delta: 216.0 MB). Peak memory consumption was 346.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:19,441 INFO L168 Benchmark]: Witness Printer took 65.11 ms. Allocated memory is still 1.3 GB. Free memory was 906.2 MB in the beginning and 897.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:19,446 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.86 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 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 86.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9878.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 906.2 MB in the end (delta: 216.0 MB). Peak memory consumption was 346.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.11 ms. Allocated memory is still 1.3 GB. Free memory was 906.2 MB in the beginning and 897.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 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: 4 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 275 SDtfs, 401 SDslu, 1859 SDs, 0 SdLazy, 2368 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 537 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 311 PreInvPairs, 397 NumberOfFragments, 78 HoareAnnotationTreeSize, 311 FomulaSimplifications, 1143 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1164 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 114027 SizeOfPredicates, 31 NumberOfNonLiveVariables, 986 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 686/962 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...