./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.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 1ced3eb982b16bda97708eba7d7a33ef6d709871 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:53:35,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:53:35,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:53:35,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:53:35,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:53:35,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:53:35,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:53:35,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:53:35,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:53:35,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:53:35,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:53:35,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:53:35,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:53:35,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:53:35,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:53:35,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:53:35,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:53:35,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:53:35,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:53:35,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:53:35,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:53:35,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:53:35,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:53:35,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:53:35,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:53:35,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:53:35,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:53:35,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:53:35,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:53:35,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:53:35,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:53:35,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:53:35,464 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:53:35,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:53:35,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:53:35,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:53:35,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:53:35,488 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:53:35,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:53:35,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:53:35,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:53:35,493 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:53:35,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:53:35,493 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:53:35,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:53:35,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:53:35,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:53:35,494 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:53:35,494 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:53:35,494 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:53:35,495 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:53:35,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:53:35,495 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:53:35,495 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:53:35,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:53:35,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:53:35,499 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:53:35,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:53:35,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:53:35,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:53:35,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:53:35,500 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:53:35,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:53:35,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:53:35,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:53:35,501 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 1ced3eb982b16bda97708eba7d7a33ef6d709871 [2019-01-12 00:53:35,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:53:35,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:53:35,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:53:35,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:53:35,577 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:53:35,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2019-01-12 00:53:35,642 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac383a43/225a72063328449bbb53ef1413ea1c73/FLAGe85751133 [2019-01-12 00:53:36,236 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:53:36,237 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2019-01-12 00:53:36,248 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac383a43/225a72063328449bbb53ef1413ea1c73/FLAGe85751133 [2019-01-12 00:53:36,488 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac383a43/225a72063328449bbb53ef1413ea1c73 [2019-01-12 00:53:36,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:53:36,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:53:36,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:36,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:53:36,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:53:36,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:36" (1/1) ... [2019-01-12 00:53:36,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be1244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:36, skipping insertion in model container [2019-01-12 00:53:36,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:36" (1/1) ... [2019-01-12 00:53:36,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:53:36,583 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:53:37,065 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:37,074 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:53:37,230 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:37,248 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:53:37,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37 WrapperNode [2019-01-12 00:53:37,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:37,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:37,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:53:37,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:53:37,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:37,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:53:37,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:53:37,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:53:37,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (1/1) ... [2019-01-12 00:53:37,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:53:37,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:53:37,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:53:37,514 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:53:37,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (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-01-12 00:53:37,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:53:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:53:40,528 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:53:40,529 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:53:40,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:40 BoogieIcfgContainer [2019-01-12 00:53:40,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:53:40,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:53:40,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:53:40,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:53:40,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:53:36" (1/3) ... [2019-01-12 00:53:40,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421ed724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:40, skipping insertion in model container [2019-01-12 00:53:40,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:37" (2/3) ... [2019-01-12 00:53:40,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421ed724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:40, skipping insertion in model container [2019-01-12 00:53:40,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:40" (3/3) ... [2019-01-12 00:53:40,539 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label42_true-unreach-call_false-termination.c [2019-01-12 00:53:40,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:53:40,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:53:40,584 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:53:40,624 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:53:40,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:53:40,625 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:53:40,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:53:40,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:53:40,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:53:40,626 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:53:40,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:53:40,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:53:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:53:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 00:53:40,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:40,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:40,681 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1613704130, now seen corresponding path program 1 times [2019-01-12 00:53:40,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:40,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:41,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:41,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:41,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:41,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:41,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:41,196 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-01-12 00:53:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:42,566 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-01-12 00:53:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:42,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-12 00:53:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:42,583 INFO L225 Difference]: With dead ends: 528 [2019-01-12 00:53:42,584 INFO L226 Difference]: Without dead ends: 266 [2019-01-12 00:53:42,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-12 00:53:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-01-12 00:53:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 00:53:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-01-12 00:53:42,648 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 115 [2019-01-12 00:53:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:42,649 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-01-12 00:53:42,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-01-12 00:53:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 00:53:42,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:42,660 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:42,661 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:42,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1626358534, now seen corresponding path program 1 times [2019-01-12 00:53:42,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:42,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:42,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:53:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:42,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:42,959 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 4 states. [2019-01-12 00:53:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:44,763 INFO L93 Difference]: Finished difference Result 1054 states and 1488 transitions. [2019-01-12 00:53:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:44,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-01-12 00:53:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:44,773 INFO L225 Difference]: With dead ends: 1054 [2019-01-12 00:53:44,774 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:53:44,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:53:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 528. [2019-01-12 00:53:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-01-12 00:53:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-01-12 00:53:44,831 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 119 [2019-01-12 00:53:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:44,833 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-01-12 00:53:44,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-01-12 00:53:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 00:53:44,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:44,845 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:44,845 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash -951101936, now seen corresponding path program 1 times [2019-01-12 00:53:44,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:44,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:53:44,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:44,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:44,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:44,973 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-01-12 00:53:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:45,935 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-01-12 00:53:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:45,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-01-12 00:53:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:45,942 INFO L225 Difference]: With dead ends: 1316 [2019-01-12 00:53:45,942 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:53:45,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:53:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-01-12 00:53:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-12 00:53:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-01-12 00:53:45,967 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 149 [2019-01-12 00:53:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:45,968 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-01-12 00:53:45,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-01-12 00:53:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 00:53:45,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:45,971 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:45,971 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:45,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1921921286, now seen corresponding path program 1 times [2019-01-12 00:53:45,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:45,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:45,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:46,150 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 00:53:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-12 00:53:46,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:46,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:46,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:46,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:46,238 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-01-12 00:53:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:48,468 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-01-12 00:53:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:48,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-01-12 00:53:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:48,473 INFO L225 Difference]: With dead ends: 1449 [2019-01-12 00:53:48,473 INFO L226 Difference]: Without dead ends: 792 [2019-01-12 00:53:48,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-01-12 00:53:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-01-12 00:53:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:53:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-01-12 00:53:48,500 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 153 [2019-01-12 00:53:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:48,500 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-01-12 00:53:48,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-01-12 00:53:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 00:53:48,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:48,504 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:48,504 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -680769074, now seen corresponding path program 1 times [2019-01-12 00:53:48,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:48,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 00:53:48,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:48,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:48,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:48,698 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-01-12 00:53:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:49,871 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-01-12 00:53:49,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:49,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-01-12 00:53:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:49,877 INFO L225 Difference]: With dead ends: 1709 [2019-01-12 00:53:49,877 INFO L226 Difference]: Without dead ends: 1052 [2019-01-12 00:53:49,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-01-12 00:53:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-01-12 00:53:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-12 00:53:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-01-12 00:53:49,908 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 157 [2019-01-12 00:53:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:49,908 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-01-12 00:53:49,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-01-12 00:53:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-12 00:53:49,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:49,912 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:49,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:49,915 INFO L82 PathProgramCache]: Analyzing trace with hash 556803504, now seen corresponding path program 1 times [2019-01-12 00:53:49,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:49,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:49,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-12 00:53:50,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:50,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:50,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:50,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:50,093 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-01-12 00:53:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:51,393 INFO L93 Difference]: Finished difference Result 3150 states and 3974 transitions. [2019-01-12 00:53:51,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:51,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-01-12 00:53:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:51,406 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:53:51,406 INFO L226 Difference]: Without dead ends: 2231 [2019-01-12 00:53:51,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-01-12 00:53:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-01-12 00:53:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:53:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2019-01-12 00:53:51,443 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 166 [2019-01-12 00:53:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:51,443 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2019-01-12 00:53:51,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2019-01-12 00:53:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-12 00:53:51,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:51,448 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:51,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 390134956, now seen corresponding path program 1 times [2019-01-12 00:53:51,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:51,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 00:53:51,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:51,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:51,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:53:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:53:51,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:51,649 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand 5 states. [2019-01-12 00:53:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:52,743 INFO L93 Difference]: Finished difference Result 3543 states and 4355 transitions. [2019-01-12 00:53:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:53:52,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-01-12 00:53:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:52,751 INFO L225 Difference]: With dead ends: 3543 [2019-01-12 00:53:52,752 INFO L226 Difference]: Without dead ends: 2100 [2019-01-12 00:53:52,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-01-12 00:53:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-01-12 00:53:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:53:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-01-12 00:53:52,791 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 190 [2019-01-12 00:53:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:52,791 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-01-12 00:53:52,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:53:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-01-12 00:53:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 00:53:52,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:52,797 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:52,797 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 128921415, now seen corresponding path program 1 times [2019-01-12 00:53:52,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:52,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 00:53:52,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:52,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:52,931 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-01-12 00:53:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:53,754 INFO L93 Difference]: Finished difference Result 4067 states and 4903 transitions. [2019-01-12 00:53:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:53,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-01-12 00:53:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:53,765 INFO L225 Difference]: With dead ends: 4067 [2019-01-12 00:53:53,765 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:53:53,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:53:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-01-12 00:53:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:53:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-01-12 00:53:53,799 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 193 [2019-01-12 00:53:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:53,800 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-01-12 00:53:53,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-01-12 00:53:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-12 00:53:53,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:53,806 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:53,806 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2022598972, now seen corresponding path program 1 times [2019-01-12 00:53:53,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:53,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 00:53:54,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:53:54,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:53:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:54,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:53:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 00:53:54,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:53:54,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-01-12 00:53:54,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:54,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:54,590 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 4 states. [2019-01-12 00:53:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:57,130 INFO L93 Difference]: Finished difference Result 3672 states and 4041 transitions. [2019-01-12 00:53:57,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:57,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-01-12 00:53:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:57,132 INFO L225 Difference]: With dead ends: 3672 [2019-01-12 00:53:57,132 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:53:57,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:53:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:53:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:53:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:53:57,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2019-01-12 00:53:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:57,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:53:57,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:53:57,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:53:57,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:53:57,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:57,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:57,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:58,225 WARN L181 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-12 00:53:58,938 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,941 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:53:58,942 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:53:58,943 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:53:58,944 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:53:58,945 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:53:58,946 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:53:58,946 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:53:58,946 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:53:58,946 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:53:58,946 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (not (= ~a8~0 13))) (.cse4 (not (= 6 ~a16~0))) (.cse0 (<= ~a17~0 0)) (.cse5 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse7 (= ~a16~0 5)) (.cse3 (= ~a7~0 1)) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6) (and .cse3 .cse1 .cse2 .cse7) (and .cse5 .cse1 .cse2) (and .cse4 .cse0 .cse1) (and .cse5 .cse1 .cse6) (and .cse1 .cse6 .cse7) (and .cse3 .cse6))) [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:53:58,947 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:53:58,948 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:53:58,949 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:53:58,950 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:53:58,951 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a8~0 13))) (.cse4 (not (= 6 ~a16~0))) (.cse0 (<= ~a17~0 0)) (.cse5 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse7 (= ~a16~0 5)) (.cse3 (= ~a7~0 1)) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6) (and .cse3 .cse1 .cse2 .cse7) (and .cse5 .cse1 .cse2) (and .cse4 .cse0 .cse1) (and .cse5 .cse1 .cse6) (and .cse1 .cse6 .cse7) (and .cse3 .cse6))) [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:53:58,952 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:53:58,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:53:58,954 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:53:58,955 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:53:58,956 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:53:58,957 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:53:58,958 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:53:58,959 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:53:58,960 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:53:58,960 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:53:58,960 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:53:58,960 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:53:58,960 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:53:58,960 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:53:58,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:53:58 BoogieIcfgContainer [2019-01-12 00:53:58,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:53:58,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:53:58,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:53:58,981 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:53:58,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:40" (3/4) ... [2019-01-12 00:53:58,985 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:53:59,007 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:53:59,008 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:53:59,241 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:53:59,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:53:59,242 INFO L168 Benchmark]: Toolchain (without parser) took 22749.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.1 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -329.6 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,243 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:53:59,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.56 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 911.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 182.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 911.1 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,244 INFO L168 Benchmark]: Boogie Preprocessor took 81.04 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,244 INFO L168 Benchmark]: RCFGBuilder took 3016.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,245 INFO L168 Benchmark]: TraceAbstraction took 18447.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -290.8 MB). Peak memory consumption was 370.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,245 INFO L168 Benchmark]: Witness Printer took 260.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:59,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 754.56 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 911.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 182.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 911.1 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.04 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3016.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18447.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -290.8 MB). Peak memory consumption was 370.4 MB. Max. memory is 11.5 GB. * Witness Printer took 260.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((a17 <= 0 && a21 == 1) && !(a8 == 13)) || ((a7 == 1 && !(6 == a16)) && a17 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || (((a7 == 1 && a21 == 1) && !(a8 == 13)) && a16 == 5)) || ((a17 == 1 && a21 == 1) && !(a8 == 13))) || ((!(6 == a16) && a17 <= 0) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (a7 == 1 && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a17 <= 0 && a21 == 1) && !(a8 == 13)) || ((a7 == 1 && !(6 == a16)) && a17 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || (((a7 == 1 && a21 == 1) && !(a8 == 13)) && a16 == 5)) || ((a17 == 1 && a21 == 1) && !(a8 == 13))) || ((!(6 == a16) && a17 <= 0) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (a7 == 1 && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 649 SDtfs, 1722 SDslu, 80 SDs, 0 SdLazy, 4254 SolverSat, 715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1574 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 193 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2011 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 629216 SizeOfPredicates, 1 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 793/797 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...