./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer --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.23-0cd3be1 [2018-11-28 13:20:27,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:20:27,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:20:27,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:20:27,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:20:27,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:20:27,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:20:27,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:20:27,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:20:27,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:20:27,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:20:27,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:20:27,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:20:27,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:20:27,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:20:27,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:20:27,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:20:27,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:20:27,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:20:27,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:20:27,282 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:20:27,283 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:20:27,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:20:27,285 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:20:27,285 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:20:27,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:20:27,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:20:27,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:20:27,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:20:27,288 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:20:27,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:20:27,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:20:27,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:20:27,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:20:27,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:20:27,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:20:27,291 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:20:27,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:20:27,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:20:27,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:20:27,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:20:27,302 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:20:27,302 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:20:27,303 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:20:27,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:20:27,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:20:27,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:20:27,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:20:27,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:20:27,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:20:27,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:20:27,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:20:27,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:20:27,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:20:27,304 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:20:27,304 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:20:27,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:20:27,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:20:27,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:20:27,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:20:27,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:20:27,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:20:27,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:20:27,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:20:27,306 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:20:27,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:20:27,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:20:27,306 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer 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 13:20:27,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:20:27,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:20:27,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:20:27,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:20:27,343 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:20:27,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 13:20:27,384 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/data/81157b842/58d5669f6fbe4f668443fad783190171/FLAGc3d10b9c2 [2018-11-28 13:20:27,721 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:20:27,722 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 13:20:27,727 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/data/81157b842/58d5669f6fbe4f668443fad783190171/FLAGc3d10b9c2 [2018-11-28 13:20:28,147 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/data/81157b842/58d5669f6fbe4f668443fad783190171 [2018-11-28 13:20:28,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:20:28,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:20:28,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:20:28,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:20:28,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:20:28,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220bc665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28, skipping insertion in model container [2018-11-28 13:20:28,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:20:28,177 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:20:28,289 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:20:28,292 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:20:28,307 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:20:28,316 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:20:28,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28 WrapperNode [2018-11-28 13:20:28,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:20:28,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:20:28,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:20:28,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:20:28,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:20:28,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:20:28,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:20:28,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:20:28,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... [2018-11-28 13:20:28,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:20:28,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:20:28,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:20:28,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:20:28,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/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 13:20:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:20:28,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:20:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:20:28,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:20:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:20:28,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:20:28,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:20:28,613 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 13:20:28,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:20:28 BoogieIcfgContainer [2018-11-28 13:20:28,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:20:28,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:20:28,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:20:28,617 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:20:28,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:20:28" (1/3) ... [2018-11-28 13:20:28,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9dd64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:20:28, skipping insertion in model container [2018-11-28 13:20:28,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:20:28" (2/3) ... [2018-11-28 13:20:28,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9dd64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:20:28, skipping insertion in model container [2018-11-28 13:20:28,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:20:28" (3/3) ... [2018-11-28 13:20:28,620 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 13:20:28,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:20:28,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:20:28,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:20:28,660 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:20:28,661 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:20:28,661 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:20:28,661 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:20:28,661 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:20:28,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:20:28,661 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:20:28,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:20:28,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:20:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-28 13:20:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:20:28,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:28,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:20:28,680 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:28,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2018-11-28 13:20:28,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:28,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:28,802 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 13:20:28,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:28,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:28,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:28,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:28,817 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-28 13:20:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:28,851 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2018-11-28 13:20:28,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:28,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 13:20:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:28,863 INFO L225 Difference]: With dead ends: 57 [2018-11-28 13:20:28,863 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 13:20:28,865 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 13:20:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 13:20:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-28 13:20:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 13:20:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-11-28 13:20:28,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2018-11-28 13:20:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:28,893 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-11-28 13:20:28,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-11-28 13:20:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:20:28,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:28,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:20:28,894 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:28,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2018-11-28 13:20:28,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:28,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:28,928 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 13:20:28,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:28,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:28,930 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2018-11-28 13:20:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:28,953 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2018-11-28 13:20:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:28,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 13:20:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:28,954 INFO L225 Difference]: With dead ends: 67 [2018-11-28 13:20:28,954 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 13:20:28,955 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 13:20:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 13:20:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-28 13:20:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 13:20:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-11-28 13:20:28,960 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2018-11-28 13:20:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:28,961 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2018-11-28 13:20:28,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2018-11-28 13:20:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:20:28,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:28,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:20:28,962 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:28,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2018-11-28 13:20:28,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:28,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:28,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:28,986 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 13:20:28,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:28,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:28,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:28,987 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2018-11-28 13:20:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:28,998 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2018-11-28 13:20:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:28,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 13:20:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:28,999 INFO L225 Difference]: With dead ends: 63 [2018-11-28 13:20:28,999 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 13:20:29,000 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 13:20:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 13:20:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-28 13:20:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:20:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-11-28 13:20:29,005 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2018-11-28 13:20:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,005 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2018-11-28 13:20:29,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2018-11-28 13:20:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:20:29,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:20:29,006 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2018-11-28 13:20:29,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,045 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 13:20:29,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,046 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2018-11-28 13:20:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,070 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-11-28 13:20:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 13:20:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,071 INFO L225 Difference]: With dead ends: 76 [2018-11-28 13:20:29,071 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 13:20:29,072 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 13:20:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 13:20:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-11-28 13:20:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 13:20:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-11-28 13:20:29,078 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2018-11-28 13:20:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,079 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2018-11-28 13:20:29,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2018-11-28 13:20:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:20:29,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:20:29,080 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2018-11-28 13:20:29,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,105 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 13:20:29,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,106 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2018-11-28 13:20:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,132 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2018-11-28 13:20:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 13:20:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,133 INFO L225 Difference]: With dead ends: 124 [2018-11-28 13:20:29,133 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 13:20:29,134 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 13:20:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 13:20:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-28 13:20:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 13:20:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2018-11-28 13:20:29,139 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2018-11-28 13:20:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,139 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2018-11-28 13:20:29,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2018-11-28 13:20:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 13:20:29,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,140 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 13:20:29,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2018-11-28 13:20:29,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,161 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 13:20:29,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,162 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2018-11-28 13:20:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,180 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2018-11-28 13:20:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 13:20:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,182 INFO L225 Difference]: With dead ends: 111 [2018-11-28 13:20:29,182 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 13:20:29,182 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 13:20:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 13:20:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-28 13:20:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 13:20:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-11-28 13:20:29,189 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2018-11-28 13:20:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,189 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-28 13:20:29,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2018-11-28 13:20:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 13:20:29,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,190 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 13:20:29,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2018-11-28 13:20:29,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,210 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 13:20:29,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,211 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2018-11-28 13:20:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,226 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2018-11-28 13:20:29,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 13:20:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,227 INFO L225 Difference]: With dead ends: 132 [2018-11-28 13:20:29,227 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 13:20:29,228 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 13:20:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 13:20:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-11-28 13:20:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:20:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2018-11-28 13:20:29,237 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2018-11-28 13:20:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,237 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2018-11-28 13:20:29,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2018-11-28 13:20:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 13:20:29,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,238 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 13:20:29,238 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2018-11-28 13:20:29,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,254 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 13:20:29,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,255 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2018-11-28 13:20:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,268 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2018-11-28 13:20:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 13:20:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,269 INFO L225 Difference]: With dead ends: 232 [2018-11-28 13:20:29,269 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 13:20:29,270 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 13:20:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 13:20:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-28 13:20:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 13:20:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-11-28 13:20:29,281 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2018-11-28 13:20:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2018-11-28 13:20:29,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2018-11-28 13:20:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:20:29,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,282 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 13:20:29,282 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2018-11-28 13:20:29,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,309 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 13:20:29,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,310 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2018-11-28 13:20:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,336 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2018-11-28 13:20:29,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 13:20:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,338 INFO L225 Difference]: With dead ends: 204 [2018-11-28 13:20:29,338 INFO L226 Difference]: Without dead ends: 142 [2018-11-28 13:20:29,339 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 13:20:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-28 13:20:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-28 13:20:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-28 13:20:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-11-28 13:20:29,348 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2018-11-28 13:20:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,348 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-11-28 13:20:29,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-11-28 13:20:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:20:29,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,350 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 13:20:29,350 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2018-11-28 13:20:29,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,381 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 13:20:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,382 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2018-11-28 13:20:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,402 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2018-11-28 13:20:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 13:20:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,405 INFO L225 Difference]: With dead ends: 236 [2018-11-28 13:20:29,405 INFO L226 Difference]: Without dead ends: 234 [2018-11-28 13:20:29,405 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 13:20:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-28 13:20:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2018-11-28 13:20:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 13:20:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2018-11-28 13:20:29,414 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2018-11-28 13:20:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,414 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2018-11-28 13:20:29,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2018-11-28 13:20:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:20:29,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,416 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 13:20:29,416 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2018-11-28 13:20:29,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,437 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 13:20:29,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,438 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2018-11-28 13:20:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,458 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2018-11-28 13:20:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 13:20:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,459 INFO L225 Difference]: With dead ends: 444 [2018-11-28 13:20:29,460 INFO L226 Difference]: Without dead ends: 258 [2018-11-28 13:20:29,460 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 13:20:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-28 13:20:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-28 13:20:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 13:20:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2018-11-28 13:20:29,469 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2018-11-28 13:20:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,469 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2018-11-28 13:20:29,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2018-11-28 13:20:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:20:29,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,471 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 13:20:29,471 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2018-11-28 13:20:29,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,505 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 13:20:29,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,506 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2018-11-28 13:20:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,517 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2018-11-28 13:20:29,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 13:20:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,519 INFO L225 Difference]: With dead ends: 384 [2018-11-28 13:20:29,519 INFO L226 Difference]: Without dead ends: 266 [2018-11-28 13:20:29,519 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 13:20:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-28 13:20:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-11-28 13:20:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-28 13:20:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2018-11-28 13:20:29,529 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2018-11-28 13:20:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,529 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2018-11-28 13:20:29,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2018-11-28 13:20:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:20:29,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,530 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 13:20:29,530 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2018-11-28 13:20:29,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,541 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 13:20:29,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,542 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2018-11-28 13:20:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,559 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2018-11-28 13:20:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 13:20:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,561 INFO L225 Difference]: With dead ends: 426 [2018-11-28 13:20:29,561 INFO L226 Difference]: Without dead ends: 424 [2018-11-28 13:20:29,562 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 13:20:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-28 13:20:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2018-11-28 13:20:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-28 13:20:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2018-11-28 13:20:29,576 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2018-11-28 13:20:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,576 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2018-11-28 13:20:29,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2018-11-28 13:20:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:20:29,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,577 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 13:20:29,578 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2018-11-28 13:20:29,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,589 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 13:20:29,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:29,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:29,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:29,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:29,590 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2018-11-28 13:20:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:29,608 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2018-11-28 13:20:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:29,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 13:20:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:29,608 INFO L225 Difference]: With dead ends: 856 [2018-11-28 13:20:29,609 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:20:29,610 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 13:20:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:20:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:20:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:20:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:20:29,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-28 13:20:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,611 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:20:29,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:20:29,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:20:29,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 13:20:29,635 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 13:20:29,635 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:20:29,635 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:20:29,635 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 13:20:29,635 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:20:29,635 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,636 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-28 13:20:29,637 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-28 13:20:29,637 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-28 13:20:29,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:20:29 BoogieIcfgContainer [2018-11-28 13:20:29,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:20:29,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:20:29,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:20:29,642 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:20:29,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:20:28" (3/4) ... [2018-11-28 13:20:29,645 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:20:29,649 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:20:29,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:20:29,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 13:20:29,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 13:20:29,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:20:29,690 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_91e19a10-23c8-49c9-a52b-afe25be409a5/bin-2019/uautomizer/witness.graphml [2018-11-28 13:20:29,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:20:29,691 INFO L168 Benchmark]: Toolchain (without parser) took 1540.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 961.4 MB in the beginning and 970.4 MB in the end (delta: -9.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:29,692 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:29,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:29,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.65 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:29,693 INFO L168 Benchmark]: Boogie Preprocessor took 16.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:29,693 INFO L168 Benchmark]: RCFGBuilder took 264.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:29,694 INFO L168 Benchmark]: TraceAbstraction took 1027.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:29,694 INFO L168 Benchmark]: Witness Printer took 48.14 ms. Allocated memory is still 1.2 GB. Free memory is still 970.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:29,696 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.65 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1027.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. * Witness Printer took 48.14 ms. Allocated memory is still 1.2 GB. Free memory is still 970.4 MB. There was no memory consumed. 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, 0.9s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s 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...