./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/20_lamport_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/20_lamport_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fadcfc916b2f65c1721b9377548800a44202c5e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:27:03,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:27:03,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:27:03,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:27:03,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:27:03,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:27:03,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:27:03,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:27:03,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:27:03,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:27:03,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:27:03,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:27:03,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:27:03,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:27:03,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:27:03,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:27:03,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:27:03,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:27:03,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:27:03,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:27:03,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:27:03,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:27:03,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:27:03,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:27:03,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:27:03,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:27:03,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:27:03,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:27:03,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:27:03,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:27:03,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:27:03,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:27:03,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:27:03,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:27:03,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:27:03,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:27:03,399 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 15:27:03,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:27:03,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:27:03,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:27:03,406 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:27:03,406 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:27:03,406 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:27:03,406 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:27:03,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:27:03,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:27:03,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:27:03,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:27:03,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:27:03,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:27:03,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:27:03,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:27:03,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:27:03,409 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:27:03,410 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:27:03,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:27:03,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:27:03,410 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 15:27:03,410 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan 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 -> Taipan 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 -> 8fadcfc916b2f65c1721b9377548800a44202c5e [2018-12-09 15:27:03,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:27:03,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:27:03,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:27:03,444 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:27:03,444 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:27:03,445 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/../../sv-benchmarks/c/pthread-ext/20_lamport_true-unreach-call.i [2018-12-09 15:27:03,478 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/data/61a972d36/12aeecfcceef4bb0aad382b013b85636/FLAGf01253100 [2018-12-09 15:27:03,838 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:27:03,839 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/sv-benchmarks/c/pthread-ext/20_lamport_true-unreach-call.i [2018-12-09 15:27:03,845 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/data/61a972d36/12aeecfcceef4bb0aad382b013b85636/FLAGf01253100 [2018-12-09 15:27:04,221 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/data/61a972d36/12aeecfcceef4bb0aad382b013b85636 [2018-12-09 15:27:04,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:27:04,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:27:04,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:27:04,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:27:04,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:27:04,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e48869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04, skipping insertion in model container [2018-12-09 15:27:04,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:27:04,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:27:04,408 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:27:04,414 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:27:04,481 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:27:04,520 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:27:04,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04 WrapperNode [2018-12-09 15:27:04,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:27:04,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:27:04,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:27:04,521 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:27:04,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:27:04,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:27:04,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:27:04,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:27:04,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... [2018-12-09 15:27:04,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:27:04,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:27:04,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:27:04,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:27:04,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/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-12-09 15:27:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:27:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2018-12-09 15:27:04,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2018-12-09 15:27:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:27:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:27:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:27:04,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:27:04,607 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 15:27:04,764 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:27:04,764 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-09 15:27:04,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:04 BoogieIcfgContainer [2018-12-09 15:27:04,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:27:04,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:27:04,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:27:04,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:27:04,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:27:04" (1/3) ... [2018-12-09 15:27:04,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da78739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:04, skipping insertion in model container [2018-12-09 15:27:04,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:04" (2/3) ... [2018-12-09 15:27:04,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da78739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:04, skipping insertion in model container [2018-12-09 15:27:04,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:04" (3/3) ... [2018-12-09 15:27:04,768 INFO L112 eAbstractionObserver]: Analyzing ICFG 20_lamport_true-unreach-call.i [2018-12-09 15:27:04,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:27:04,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:27:04,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:27:04,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:27:04,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:27:04,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:27:04,790 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 15:27:04,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:27:04,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 15:27:04,803 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 15:27:04,817 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:27:04,817 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:27:04,817 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:27:04,817 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:27:04,817 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:27:04,818 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:27:04,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:27:04,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:27:04,823 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68places, 90 transitions [2018-12-09 15:27:04,846 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 771 states. [2018-12-09 15:27:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states. [2018-12-09 15:27:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:27:04,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:04,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:04,854 INFO L423 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:04,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1426480077, now seen corresponding path program 1 times [2018-12-09 15:27:04,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:04,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:04,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:04,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:04,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:27:04,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:04,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 15:27:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 15:27:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:27:04,949 INFO L87 Difference]: Start difference. First operand 771 states. Second operand 2 states. [2018-12-09 15:27:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:04,970 INFO L93 Difference]: Finished difference Result 771 states and 1810 transitions. [2018-12-09 15:27:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 15:27:04,971 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-09 15:27:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:04,982 INFO L225 Difference]: With dead ends: 771 [2018-12-09 15:27:04,982 INFO L226 Difference]: Without dead ends: 716 [2018-12-09 15:27:04,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:27:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-12-09 15:27:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2018-12-09 15:27:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-12-09 15:27:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1700 transitions. [2018-12-09 15:27:05,025 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1700 transitions. Word has length 17 [2018-12-09 15:27:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,025 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 1700 transitions. [2018-12-09 15:27:05,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 15:27:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1700 transitions. [2018-12-09 15:27:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:27:05,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1164346297, now seen corresponding path program 1 times [2018-12-09 15:27:05,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:05,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,063 INFO L87 Difference]: Start difference. First operand 716 states and 1700 transitions. Second operand 3 states. [2018-12-09 15:27:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,086 INFO L93 Difference]: Finished difference Result 707 states and 1649 transitions. [2018-12-09 15:27:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 15:27:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,089 INFO L225 Difference]: With dead ends: 707 [2018-12-09 15:27:05,089 INFO L226 Difference]: Without dead ends: 531 [2018-12-09 15:27:05,089 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-12-09 15:27:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-09 15:27:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 516. [2018-12-09 15:27:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-12-09 15:27:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1221 transitions. [2018-12-09 15:27:05,105 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1221 transitions. Word has length 23 [2018-12-09 15:27:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,105 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 1221 transitions. [2018-12-09 15:27:05,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1221 transitions. [2018-12-09 15:27:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 15:27:05,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,107 INFO L423 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2054278107, now seen corresponding path program 1 times [2018-12-09 15:27:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,138 INFO L87 Difference]: Start difference. First operand 516 states and 1221 transitions. Second operand 3 states. [2018-12-09 15:27:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,157 INFO L93 Difference]: Finished difference Result 485 states and 1140 transitions. [2018-12-09 15:27:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 15:27:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,159 INFO L225 Difference]: With dead ends: 485 [2018-12-09 15:27:05,159 INFO L226 Difference]: Without dead ends: 385 [2018-12-09 15:27:05,159 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-12-09 15:27:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-09 15:27:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-12-09 15:27:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-12-09 15:27:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 916 transitions. [2018-12-09 15:27:05,164 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 916 transitions. Word has length 27 [2018-12-09 15:27:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,165 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 916 transitions. [2018-12-09 15:27:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 916 transitions. [2018-12-09 15:27:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:27:05,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash -474527472, now seen corresponding path program 1 times [2018-12-09 15:27:05,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:05,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,197 INFO L87 Difference]: Start difference. First operand 385 states and 916 transitions. Second operand 3 states. [2018-12-09 15:27:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,235 INFO L93 Difference]: Finished difference Result 474 states and 1100 transitions. [2018-12-09 15:27:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 15:27:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,237 INFO L225 Difference]: With dead ends: 474 [2018-12-09 15:27:05,237 INFO L226 Difference]: Without dead ends: 378 [2018-12-09 15:27:05,237 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-12-09 15:27:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-09 15:27:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2018-12-09 15:27:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-09 15:27:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 827 transitions. [2018-12-09 15:27:05,245 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 827 transitions. Word has length 36 [2018-12-09 15:27:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,245 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 827 transitions. [2018-12-09 15:27:05,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 827 transitions. [2018-12-09 15:27:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:27:05,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash -508146392, now seen corresponding path program 2 times [2018-12-09 15:27:05,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,274 INFO L87 Difference]: Start difference. First operand 361 states and 827 transitions. Second operand 3 states. [2018-12-09 15:27:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,288 INFO L93 Difference]: Finished difference Result 544 states and 1180 transitions. [2018-12-09 15:27:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 15:27:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,290 INFO L225 Difference]: With dead ends: 544 [2018-12-09 15:27:05,291 INFO L226 Difference]: Without dead ends: 544 [2018-12-09 15:27:05,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-12-09 15:27:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 397. [2018-12-09 15:27:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-09 15:27:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 900 transitions. [2018-12-09 15:27:05,301 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 900 transitions. Word has length 36 [2018-12-09 15:27:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,301 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 900 transitions. [2018-12-09 15:27:05,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 900 transitions. [2018-12-09 15:27:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:27:05,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,303 INFO L423 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1093964798, now seen corresponding path program 3 times [2018-12-09 15:27:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:27:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,337 INFO L87 Difference]: Start difference. First operand 397 states and 900 transitions. Second operand 3 states. [2018-12-09 15:27:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,350 INFO L93 Difference]: Finished difference Result 502 states and 1034 transitions. [2018-12-09 15:27:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 15:27:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,352 INFO L225 Difference]: With dead ends: 502 [2018-12-09 15:27:05,352 INFO L226 Difference]: Without dead ends: 499 [2018-12-09 15:27:05,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-12-09 15:27:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 371. [2018-12-09 15:27:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-09 15:27:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 796 transitions. [2018-12-09 15:27:05,362 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 796 transitions. Word has length 36 [2018-12-09 15:27:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,363 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 796 transitions. [2018-12-09 15:27:05,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 796 transitions. [2018-12-09 15:27:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:27:05,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,365 INFO L423 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2116291725, now seen corresponding path program 1 times [2018-12-09 15:27:05,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:27:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,388 INFO L87 Difference]: Start difference. First operand 371 states and 796 transitions. Second operand 3 states. [2018-12-09 15:27:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,417 INFO L93 Difference]: Finished difference Result 340 states and 669 transitions. [2018-12-09 15:27:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 15:27:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,418 INFO L225 Difference]: With dead ends: 340 [2018-12-09 15:27:05,419 INFO L226 Difference]: Without dead ends: 265 [2018-12-09 15:27:05,419 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-12-09 15:27:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-12-09 15:27:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 236. [2018-12-09 15:27:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-09 15:27:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 446 transitions. [2018-12-09 15:27:05,426 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 446 transitions. Word has length 36 [2018-12-09 15:27:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,426 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 446 transitions. [2018-12-09 15:27:05,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 446 transitions. [2018-12-09 15:27:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:27:05,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1252994, now seen corresponding path program 1 times [2018-12-09 15:27:05,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,451 INFO L87 Difference]: Start difference. First operand 236 states and 446 transitions. Second operand 3 states. [2018-12-09 15:27:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,461 INFO L93 Difference]: Finished difference Result 228 states and 430 transitions. [2018-12-09 15:27:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 15:27:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,461 INFO L225 Difference]: With dead ends: 228 [2018-12-09 15:27:05,462 INFO L226 Difference]: Without dead ends: 200 [2018-12-09 15:27:05,462 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-12-09 15:27:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-09 15:27:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-09 15:27:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-09 15:27:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 377 transitions. [2018-12-09 15:27:05,465 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 377 transitions. Word has length 39 [2018-12-09 15:27:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,465 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 377 transitions. [2018-12-09 15:27:05,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 377 transitions. [2018-12-09 15:27:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:27:05,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:27:05,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:27:05,466 INFO L423 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:27:05,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:27:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1344765993, now seen corresponding path program 1 times [2018-12-09 15:27:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:27:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:27:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:27:05,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:27:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:05,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:27:05,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:27:05,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:27:05,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:27:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:27:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:27:05,482 INFO L87 Difference]: Start difference. First operand 200 states and 377 transitions. Second operand 3 states. [2018-12-09 15:27:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:27:05,486 INFO L93 Difference]: Finished difference Result 135 states and 273 transitions. [2018-12-09 15:27:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:27:05,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 15:27:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:27:05,487 INFO L225 Difference]: With dead ends: 135 [2018-12-09 15:27:05,487 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:27:05,487 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-12-09 15:27:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:27:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:27:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:27:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:27:05,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-09 15:27:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:27:05,487 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:27:05,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:27:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:27:05,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:27:05,489 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 15:27:05,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:27:05 BasicIcfg [2018-12-09 15:27:05,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:27:05,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:27:05,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:27:05,491 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:27:05,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:04" (3/4) ... [2018-12-09 15:27:05,494 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:27:05,498 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2018-12-09 15:27:05,501 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 15:27:05,501 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 15:27:05,525 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_585658db-b999-4e46-923b-26c55786ba23/bin-2019/utaipan/witness.graphml [2018-12-09 15:27:05,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:27:05,525 INFO L168 Benchmark]: Toolchain (without parser) took 1300.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 925.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 138.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,526 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:27:05,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,527 INFO L168 Benchmark]: Boogie Preprocessor took 20.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,527 INFO L168 Benchmark]: RCFGBuilder took 192.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,528 INFO L168 Benchmark]: TraceAbstraction took 725.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 930.8 MB in the end (delta: 138.1 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,528 INFO L168 Benchmark]: Witness Printer took 33.82 ms. Allocated memory is still 1.1 GB. Free memory was 928.1 MB in the beginning and 925.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:05,530 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 725.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 930.8 MB in the end (delta: 138.1 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. * Witness Printer took 33.82 ms. Allocated memory is still 1.1 GB. Free memory was 928.1 MB in the beginning and 925.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 660]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 686]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 660]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 91 locations, 3 error locations. SAFE Result, 0.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 774 SDtfs, 277 SDslu, 433 SDs, 0 SdLazy, 85 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=771occurred in iteration=0, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 12576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...