./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/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_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/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-aa41828 [2018-11-23 14:48:18,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:48:18,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:48:18,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:48:18,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:48:18,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:48:18,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:48:18,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:48:18,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:48:18,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:48:18,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:48:18,721 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:48:18,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:48:18,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:48:18,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:48:18,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:48:18,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:48:18,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:48:18,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:48:18,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:48:18,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:48:18,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:48:18,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:48:18,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:48:18,733 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:48:18,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:48:18,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:48:18,735 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:48:18,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:48:18,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:48:18,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:48:18,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:48:18,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:48:18,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:48:18,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:48:18,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:48:18,739 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:48:18,750 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:48:18,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:48:18,751 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:48:18,751 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:48:18,751 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:48:18,751 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:48:18,751 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:48:18,751 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:48:18,751 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:48:18,752 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:48:18,752 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:48:18,752 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:48:18,752 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:48:18,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:48:18,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:48:18,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:48:18,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:48:18,754 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:48:18,754 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:48:18,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:48:18,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:48:18,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:48:18,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:48:18,755 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:48:18,755 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_7d052e1c-28c7-46c1-b1a9-14e40477660e/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-11-23 14:48:18,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:48:18,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:48:18,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:48:18,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:48:18,789 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:48:18,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-ext/20_lamport_true-unreach-call.i [2018-11-23 14:48:18,825 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/data/3f96e1f1b/ba0a3f20dd23407f93b73da34d763ab7/FLAG46af39cc7 [2018-11-23 14:48:19,212 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:48:19,213 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/sv-benchmarks/c/pthread-ext/20_lamport_true-unreach-call.i [2018-11-23 14:48:19,222 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/data/3f96e1f1b/ba0a3f20dd23407f93b73da34d763ab7/FLAG46af39cc7 [2018-11-23 14:48:19,587 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/data/3f96e1f1b/ba0a3f20dd23407f93b73da34d763ab7 [2018-11-23 14:48:19,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:48:19,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:48:19,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:48:19,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:48:19,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:48:19,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666054be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19, skipping insertion in model container [2018-11-23 14:48:19,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:48:19,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:48:19,843 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:48:19,849 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:48:19,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:48:19,954 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:48:19,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19 WrapperNode [2018-11-23 14:48:19,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:48:19,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:48:19,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:48:19,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:48:19,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:48:19,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:48:19,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:48:19,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:48:19,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:19,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:20,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:20,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... [2018-11-23 14:48:20,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:48:20,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:48:20,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:48:20,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:48:20,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/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-11-23 14:48:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:48:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2018-11-23 14:48:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2018-11-23 14:48:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:48:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:48:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:48:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:48:20,049 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-23 14:48:20,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:48:20,271 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 14:48:20,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:48:20 BoogieIcfgContainer [2018-11-23 14:48:20,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:48:20,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:48:20,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:48:20,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:48:20,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:48:19" (1/3) ... [2018-11-23 14:48:20,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b30da03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:48:20, skipping insertion in model container [2018-11-23 14:48:20,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:19" (2/3) ... [2018-11-23 14:48:20,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b30da03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:48:20, skipping insertion in model container [2018-11-23 14:48:20,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:48:20" (3/3) ... [2018-11-23 14:48:20,278 INFO L112 eAbstractionObserver]: Analyzing ICFG 20_lamport_true-unreach-call.i [2018-11-23 14:48:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:48:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:48:20,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:48:20,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:48:20,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:48:20,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:48:20,299 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-23 14:48:20,299 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:48:20,304 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 14:48:20,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 14:48:20,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:48:20,330 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:48:20,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:48:20,331 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:48:20,331 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:48:20,331 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:48:20,331 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:48:20,331 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:48:20,336 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68places, 90 transitions [2018-11-23 14:48:20,365 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 771 states. [2018-11-23 14:48:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states. [2018-11-23 14:48:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:48:20,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:20,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:48:20,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:20,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1426480077, now seen corresponding path program 1 times [2018-11-23 14:48:20,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:20,469 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-23 14:48:20,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:20,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:48:20,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:20,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:48:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:48:20,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:48:20,483 INFO L87 Difference]: Start difference. First operand 771 states. Second operand 2 states. [2018-11-23 14:48:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:20,510 INFO L93 Difference]: Finished difference Result 771 states and 1810 transitions. [2018-11-23 14:48:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:48:20,511 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 14:48:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:20,525 INFO L225 Difference]: With dead ends: 771 [2018-11-23 14:48:20,525 INFO L226 Difference]: Without dead ends: 716 [2018-11-23 14:48:20,526 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-11-23 14:48:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-11-23 14:48:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2018-11-23 14:48:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-11-23 14:48:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1700 transitions. [2018-11-23 14:48:20,579 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1700 transitions. Word has length 17 [2018-11-23 14:48:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:20,579 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 1700 transitions. [2018-11-23 14:48:20,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:48:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1700 transitions. [2018-11-23 14:48:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:48:20,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:20,580 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-11-23 14:48:20,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:20,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1164346297, now seen corresponding path program 1 times [2018-11-23 14:48:20,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:20,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:20,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:20,631 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-23 14:48:20,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:20,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:20,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:20,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:20,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:20,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:20,633 INFO L87 Difference]: Start difference. First operand 716 states and 1700 transitions. Second operand 3 states. [2018-11-23 14:48:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:20,673 INFO L93 Difference]: Finished difference Result 707 states and 1649 transitions. [2018-11-23 14:48:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:20,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 14:48:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:20,676 INFO L225 Difference]: With dead ends: 707 [2018-11-23 14:48:20,676 INFO L226 Difference]: Without dead ends: 531 [2018-11-23 14:48:20,677 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-23 14:48:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-11-23 14:48:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 516. [2018-11-23 14:48:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-23 14:48:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1221 transitions. [2018-11-23 14:48:20,691 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1221 transitions. Word has length 23 [2018-11-23 14:48:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:20,692 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 1221 transitions. [2018-11-23 14:48:20,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1221 transitions. [2018-11-23 14:48:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:48:20,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:20,694 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-11-23 14:48:20,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:20,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2054278107, now seen corresponding path program 1 times [2018-11-23 14:48:20,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:20,742 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-23 14:48:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:20,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:20,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:20,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:20,744 INFO L87 Difference]: Start difference. First operand 516 states and 1221 transitions. Second operand 3 states. [2018-11-23 14:48:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:20,777 INFO L93 Difference]: Finished difference Result 485 states and 1140 transitions. [2018-11-23 14:48:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:20,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 14:48:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:20,779 INFO L225 Difference]: With dead ends: 485 [2018-11-23 14:48:20,779 INFO L226 Difference]: Without dead ends: 385 [2018-11-23 14:48:20,779 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-23 14:48:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-11-23 14:48:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-11-23 14:48:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-23 14:48:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 916 transitions. [2018-11-23 14:48:20,792 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 916 transitions. Word has length 27 [2018-11-23 14:48:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:20,792 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 916 transitions. [2018-11-23 14:48:20,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 916 transitions. [2018-11-23 14:48:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:48:20,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:20,795 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-11-23 14:48:20,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:20,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash -15334753, now seen corresponding path program 1 times [2018-11-23 14:48:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:20,835 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-23 14:48:20,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:20,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:20,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:20,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:20,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:20,836 INFO L87 Difference]: Start difference. First operand 385 states and 916 transitions. Second operand 3 states. [2018-11-23 14:48:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:20,908 INFO L93 Difference]: Finished difference Result 494 states and 1165 transitions. [2018-11-23 14:48:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:20,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 14:48:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:20,911 INFO L225 Difference]: With dead ends: 494 [2018-11-23 14:48:20,911 INFO L226 Difference]: Without dead ends: 407 [2018-11-23 14:48:20,911 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-23 14:48:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-23 14:48:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 390. [2018-11-23 14:48:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-23 14:48:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 902 transitions. [2018-11-23 14:48:20,920 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 902 transitions. Word has length 36 [2018-11-23 14:48:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:20,920 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 902 transitions. [2018-11-23 14:48:20,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 902 transitions. [2018-11-23 14:48:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:48:20,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:20,922 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-11-23 14:48:20,922 INFO L423 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:20,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1895447976, now seen corresponding path program 1 times [2018-11-23 14:48:20,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:20,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:20,956 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-23 14:48:20,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:20,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:20,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:20,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:20,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:20,957 INFO L87 Difference]: Start difference. First operand 390 states and 902 transitions. Second operand 3 states. [2018-11-23 14:48:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:20,992 INFO L93 Difference]: Finished difference Result 570 states and 1234 transitions. [2018-11-23 14:48:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:20,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 14:48:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:20,995 INFO L225 Difference]: With dead ends: 570 [2018-11-23 14:48:20,995 INFO L226 Difference]: Without dead ends: 570 [2018-11-23 14:48:20,995 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-11-23 14:48:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-23 14:48:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 411. [2018-11-23 14:48:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-23 14:48:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 930 transitions. [2018-11-23 14:48:21,005 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 930 transitions. Word has length 36 [2018-11-23 14:48:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:21,006 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 930 transitions. [2018-11-23 14:48:21,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 930 transitions. [2018-11-23 14:48:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:48:21,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:21,007 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-11-23 14:48:21,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:21,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -720932738, now seen corresponding path program 2 times [2018-11-23 14:48:21,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:21,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:21,036 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-23 14:48:21,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:21,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:21,037 INFO L87 Difference]: Start difference. First operand 411 states and 930 transitions. Second operand 3 states. [2018-11-23 14:48:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:21,167 INFO L93 Difference]: Finished difference Result 364 states and 745 transitions. [2018-11-23 14:48:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:21,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 14:48:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:21,169 INFO L225 Difference]: With dead ends: 364 [2018-11-23 14:48:21,170 INFO L226 Difference]: Without dead ends: 269 [2018-11-23 14:48:21,170 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-23 14:48:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-23 14:48:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 242. [2018-11-23 14:48:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-23 14:48:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 463 transitions. [2018-11-23 14:48:21,175 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 463 transitions. Word has length 36 [2018-11-23 14:48:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:21,176 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 463 transitions. [2018-11-23 14:48:21,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 463 transitions. [2018-11-23 14:48:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:48:21,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:21,177 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-11-23 14:48:21,178 INFO L423 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:21,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1763848476, now seen corresponding path program 3 times [2018-11-23 14:48:21,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:48:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:21,220 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-23 14:48:21,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:21,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:48:21,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:21,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:48:21,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:48:21,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:48:21,221 INFO L87 Difference]: Start difference. First operand 242 states and 463 transitions. Second operand 4 states. [2018-11-23 14:48:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:21,246 INFO L93 Difference]: Finished difference Result 349 states and 656 transitions. [2018-11-23 14:48:21,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:21,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 14:48:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:21,248 INFO L225 Difference]: With dead ends: 349 [2018-11-23 14:48:21,248 INFO L226 Difference]: Without dead ends: 346 [2018-11-23 14:48:21,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:48:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-23 14:48:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 236. [2018-11-23 14:48:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-23 14:48:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 446 transitions. [2018-11-23 14:48:21,253 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 446 transitions. Word has length 36 [2018-11-23 14:48:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:21,253 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 446 transitions. [2018-11-23 14:48:21,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:48:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 446 transitions. [2018-11-23 14:48:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 14:48:21,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:21,254 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-11-23 14:48:21,254 INFO L423 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:21,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:21,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1688043969, now seen corresponding path program 1 times [2018-11-23 14:48:21,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:48:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:21,291 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-23 14:48:21,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:21,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:21,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:21,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:21,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:21,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:21,293 INFO L87 Difference]: Start difference. First operand 236 states and 446 transitions. Second operand 3 states. [2018-11-23 14:48:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:21,299 INFO L93 Difference]: Finished difference Result 228 states and 430 transitions. [2018-11-23 14:48:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:21,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 14:48:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:21,301 INFO L225 Difference]: With dead ends: 228 [2018-11-23 14:48:21,301 INFO L226 Difference]: Without dead ends: 204 [2018-11-23 14:48:21,301 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-23 14:48:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-23 14:48:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-11-23 14:48:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 14:48:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 385 transitions. [2018-11-23 14:48:21,305 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 385 transitions. Word has length 39 [2018-11-23 14:48:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:21,307 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 385 transitions. [2018-11-23 14:48:21,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 385 transitions. [2018-11-23 14:48:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 14:48:21,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:48:21,308 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-11-23 14:48:21,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:48:21,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:48:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1400762602, now seen corresponding path program 1 times [2018-11-23 14:48:21,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:48:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:48:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:48:21,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:48:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:21,335 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-23 14:48:21,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:48:21,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:48:21,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:48:21,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:48:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:48:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:48:21,337 INFO L87 Difference]: Start difference. First operand 204 states and 385 transitions. Second operand 3 states. [2018-11-23 14:48:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:48:21,341 INFO L93 Difference]: Finished difference Result 139 states and 281 transitions. [2018-11-23 14:48:21,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:48:21,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 14:48:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:48:21,342 INFO L225 Difference]: With dead ends: 139 [2018-11-23 14:48:21,343 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 14:48:21,343 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-23 14:48:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 14:48:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 14:48:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 14:48:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 14:48:21,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-23 14:48:21,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:48:21,345 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:48:21,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:48:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:48:21,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:48:21,347 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-23 14:48:21,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:48:21 BasicIcfg [2018-11-23 14:48:21,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:48:21,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:48:21,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:48:21,349 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:48:21,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:48:20" (3/4) ... [2018-11-23 14:48:21,353 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:48:21,357 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2018-11-23 14:48:21,361 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 14:48:21,361 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 14:48:21,390 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7d052e1c-28c7-46c1-b1a9-14e40477660e/bin-2019/utaipan/witness.graphml [2018-11-23 14:48:21,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:48:21,391 INFO L168 Benchmark]: Toolchain (without parser) took 1802.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.4 MB in the beginning and 976.4 MB in the end (delta: -19.9 MB). Peak memory consumption was 138.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:48:21,393 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:48:21,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:48:21,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:48:21,394 INFO L168 Benchmark]: Boogie Preprocessor took 21.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:48:21,394 INFO L168 Benchmark]: RCFGBuilder took 266.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:48:21,395 INFO L168 Benchmark]: TraceAbstraction took 1076.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.7 MB in the end (delta: 131.6 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:48:21,395 INFO L168 Benchmark]: Witness Printer took 41.49 ms. Allocated memory is still 1.2 GB. Free memory was 981.7 MB in the beginning and 976.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:48:21,398 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1076.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.7 MB in the end (delta: 131.6 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. * Witness Printer took 41.49 ms. Allocated memory is still 1.2 GB. Free memory was 981.7 MB in the beginning and 976.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 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, 1.0s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 288 SDslu, 491 SDs, 0 SdLazy, 92 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 328 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11922 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...