./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/locks/test_locks_5_true-unreach-call_true-valid-memsafety_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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:10:22,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:22,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:22,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:22,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:22,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:22,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:22,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:22,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:22,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:22,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:22,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:22,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:22,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:22,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:22,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:22,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:22,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:22,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:22,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:22,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:22,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:22,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:22,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:22,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:22,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:22,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:22,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:22,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:22,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:22,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:22,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:22,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:22,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:22,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:22,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:22,366 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:10:22,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:22,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:22,400 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:22,400 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:22,400 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:22,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:22,403 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:22,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:22,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:22,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:22,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:22,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:22,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:22,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:22,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:22,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:22,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:22,405 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:22,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:22,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:22,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:22,408 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:22,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:22,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:22,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:22,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:22,409 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:22,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:22,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:22,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:22,410 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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2018-11-28 16:10:22,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:22,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:22,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:22,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:22,469 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:22,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:22,526 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18758a51c/352ba7e2d2fc42f1ad01371ee01af16b/FLAG7a4367f87 [2018-11-28 16:10:22,966 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:22,967 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:22,974 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18758a51c/352ba7e2d2fc42f1ad01371ee01af16b/FLAG7a4367f87 [2018-11-28 16:10:23,333 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18758a51c/352ba7e2d2fc42f1ad01371ee01af16b [2018-11-28 16:10:23,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:23,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:23,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:23,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:23,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:23,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c78ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23, skipping insertion in model container [2018-11-28 16:10:23,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:23,384 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:23,623 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:23,629 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:23,663 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:23,683 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:23,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23 WrapperNode [2018-11-28 16:10:23,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:23,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:23,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:23,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:23,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:23,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:23,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:23,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:23,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (1/1) ... [2018-11-28 16:10:23,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:23,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:23,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:23,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:23,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (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 [2018-11-28 16:10:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:23,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:23,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:23,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:23,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:23,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:24,361 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:24,361 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:24,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:24 BoogieIcfgContainer [2018-11-28 16:10:24,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:24,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:24,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:24,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:24,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:23" (1/3) ... [2018-11-28 16:10:24,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b54548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:24, skipping insertion in model container [2018-11-28 16:10:24,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:23" (2/3) ... [2018-11-28 16:10:24,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b54548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:24, skipping insertion in model container [2018-11-28 16:10:24,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:24" (3/3) ... [2018-11-28 16:10:24,372 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:24,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:24,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:24,410 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:24,443 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:24,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:24,444 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:24,445 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:24,445 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:24,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:24,445 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:24,446 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:24,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-28 16:10:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 16:10:24,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:24,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:24,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:24,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2018-11-28 16:10:24,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:24,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:24,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,676 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-28 16:10:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:24,759 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2018-11-28 16:10:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:24,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 16:10:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:24,771 INFO L225 Difference]: With dead ends: 57 [2018-11-28 16:10:24,771 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 16:10:24,774 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 [2018-11-28 16:10:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 16:10:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-28 16:10:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 16:10:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-11-28 16:10:24,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2018-11-28 16:10:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:24,816 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-11-28 16:10:24,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-11-28 16:10:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 16:10:24,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:24,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:24,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:24,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2018-11-28 16:10:24,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:24,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:24,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:24,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:24,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,909 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2018-11-28 16:10:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,002 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2018-11-28 16:10:25,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 16:10:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,004 INFO L225 Difference]: With dead ends: 67 [2018-11-28 16:10:25,004 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 16:10:25,005 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 [2018-11-28 16:10:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 16:10:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-28 16:10:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 16:10:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-11-28 16:10:25,013 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2018-11-28 16:10:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,014 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2018-11-28 16:10:25,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2018-11-28 16:10:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 16:10:25,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,015 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2018-11-28 16:10:25,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,076 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2018-11-28 16:10:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,113 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2018-11-28 16:10:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 16:10:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,115 INFO L225 Difference]: With dead ends: 63 [2018-11-28 16:10:25,115 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 16:10:25,116 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 [2018-11-28 16:10:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 16:10:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-28 16:10:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 16:10:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-11-28 16:10:25,124 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2018-11-28 16:10:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,124 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2018-11-28 16:10:25,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2018-11-28 16:10:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 16:10:25,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,126 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2018-11-28 16:10:25,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,178 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2018-11-28 16:10:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,208 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-11-28 16:10:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 16:10:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,210 INFO L225 Difference]: With dead ends: 76 [2018-11-28 16:10:25,210 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 16:10:25,211 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 [2018-11-28 16:10:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 16:10:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-11-28 16:10:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 16:10:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-11-28 16:10:25,220 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2018-11-28 16:10:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,221 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2018-11-28 16:10:25,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2018-11-28 16:10:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 16:10:25,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2018-11-28 16:10:25,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,284 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2018-11-28 16:10:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,342 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2018-11-28 16:10:25,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 16:10:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,344 INFO L225 Difference]: With dead ends: 124 [2018-11-28 16:10:25,344 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 16:10:25,345 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 [2018-11-28 16:10:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 16:10:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-28 16:10:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 16:10:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2018-11-28 16:10:25,357 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2018-11-28 16:10:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,357 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2018-11-28 16:10:25,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2018-11-28 16:10:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:25,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,362 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2018-11-28 16:10:25,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,439 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2018-11-28 16:10:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,508 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2018-11-28 16:10:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,512 INFO L225 Difference]: With dead ends: 111 [2018-11-28 16:10:25,512 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 16:10:25,513 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 [2018-11-28 16:10:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 16:10:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-28 16:10:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 16:10:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-11-28 16:10:25,523 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2018-11-28 16:10:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,523 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-28 16:10:25,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2018-11-28 16:10:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:25,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,525 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2018-11-28 16:10:25,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,569 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2018-11-28 16:10:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,594 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2018-11-28 16:10:25,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,600 INFO L225 Difference]: With dead ends: 132 [2018-11-28 16:10:25,600 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 16:10:25,602 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 [2018-11-28 16:10:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 16:10:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-11-28 16:10:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 16:10:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2018-11-28 16:10:25,618 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2018-11-28 16:10:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,619 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2018-11-28 16:10:25,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2018-11-28 16:10:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:25,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,621 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2018-11-28 16:10:25,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,689 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2018-11-28 16:10:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,761 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2018-11-28 16:10:25,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,763 INFO L225 Difference]: With dead ends: 232 [2018-11-28 16:10:25,763 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 16:10:25,765 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 [2018-11-28 16:10:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 16:10:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-28 16:10:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 16:10:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-11-28 16:10:25,785 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2018-11-28 16:10:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,785 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2018-11-28 16:10:25,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2018-11-28 16:10:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:25,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,788 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2018-11-28 16:10:25,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,857 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2018-11-28 16:10:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,902 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2018-11-28 16:10:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,904 INFO L225 Difference]: With dead ends: 204 [2018-11-28 16:10:25,904 INFO L226 Difference]: Without dead ends: 142 [2018-11-28 16:10:25,905 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 [2018-11-28 16:10:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-28 16:10:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-28 16:10:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-28 16:10:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-11-28 16:10:25,922 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2018-11-28 16:10:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,922 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-11-28 16:10:25,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-11-28 16:10:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:25,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,933 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2018-11-28 16:10:25,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,976 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2018-11-28 16:10:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,008 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2018-11-28 16:10:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,011 INFO L225 Difference]: With dead ends: 236 [2018-11-28 16:10:26,011 INFO L226 Difference]: Without dead ends: 234 [2018-11-28 16:10:26,012 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 [2018-11-28 16:10:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-28 16:10:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2018-11-28 16:10:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 16:10:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2018-11-28 16:10:26,026 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2018-11-28 16:10:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,027 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2018-11-28 16:10:26,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2018-11-28 16:10:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:26,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:26,030 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2018-11-28 16:10:26,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:26,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,056 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2018-11-28 16:10:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,131 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2018-11-28 16:10:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,133 INFO L225 Difference]: With dead ends: 444 [2018-11-28 16:10:26,133 INFO L226 Difference]: Without dead ends: 258 [2018-11-28 16:10:26,135 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 [2018-11-28 16:10:26,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-28 16:10:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-28 16:10:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 16:10:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2018-11-28 16:10:26,150 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2018-11-28 16:10:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,150 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2018-11-28 16:10:26,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2018-11-28 16:10:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:26,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:26,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2018-11-28 16:10:26,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:26,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,233 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2018-11-28 16:10:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,349 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2018-11-28 16:10:26,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,354 INFO L225 Difference]: With dead ends: 384 [2018-11-28 16:10:26,355 INFO L226 Difference]: Without dead ends: 266 [2018-11-28 16:10:26,356 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 [2018-11-28 16:10:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-28 16:10:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-11-28 16:10:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-28 16:10:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2018-11-28 16:10:26,372 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2018-11-28 16:10:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,374 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2018-11-28 16:10:26,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2018-11-28 16:10:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:26,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:26,377 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2018-11-28 16:10:26,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:26,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,454 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2018-11-28 16:10:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,497 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2018-11-28 16:10:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,503 INFO L225 Difference]: With dead ends: 426 [2018-11-28 16:10:26,503 INFO L226 Difference]: Without dead ends: 424 [2018-11-28 16:10:26,504 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 [2018-11-28 16:10:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-28 16:10:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2018-11-28 16:10:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-28 16:10:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2018-11-28 16:10:26,522 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2018-11-28 16:10:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,522 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2018-11-28 16:10:26,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2018-11-28 16:10:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:26,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:26,525 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2018-11-28 16:10:26,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,587 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2018-11-28 16:10:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,664 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2018-11-28 16:10:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,665 INFO L225 Difference]: With dead ends: 856 [2018-11-28 16:10:26,665 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:26,671 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 [2018-11-28 16:10:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:26,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-28 16:10:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,673 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:26,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:26,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:26,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:26,810 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:26,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:26,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:26,811 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:26,811 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:26,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:26,811 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-28 16:10:26,811 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-28 16:10:26,811 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-28 16:10:26,812 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-28 16:10:26,814 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,814 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-28 16:10:26,814 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-28 16:10:26,814 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-28 16:10:26,814 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-28 16:10:26,815 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,815 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-28 16:10:26,815 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-28 16:10:26,815 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-28 16:10:26,815 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-28 16:10:26,815 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 16:10:26,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:26 BoogieIcfgContainer [2018-11-28 16:10:26,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:26,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:26,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:26,824 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:26,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:24" (3/4) ... [2018-11-28 16:10:26,831 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:26,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:26,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:26,847 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:26,847 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:26,847 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:26,924 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:26,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:26,929 INFO L168 Benchmark]: Toolchain (without parser) took 3589.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 952.7 MB in the beginning and 959.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 119.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:26,935 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:26,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.82 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:26,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.13 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:26,939 INFO L168 Benchmark]: Boogie Preprocessor took 49.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:26,939 INFO L168 Benchmark]: RCFGBuilder took 598.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:26,940 INFO L168 Benchmark]: TraceAbstraction took 2460.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 966.0 MB in the end (delta: 134.7 MB). Peak memory consumption was 134.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:26,941 INFO L168 Benchmark]: Witness Printer took 104.06 ms. Allocated memory is still 1.2 GB. Free memory was 966.0 MB in the beginning and 959.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:26,947 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.82 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.13 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.05 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 598.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2460.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 966.0 MB in the end (delta: 134.7 MB). Peak memory consumption was 134.7 MB. Max. memory is 11.5 GB. * Witness Printer took 104.06 ms. Allocated memory is still 1.2 GB. Free memory was 966.0 MB in the beginning and 959.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...