./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/20_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/20_lamport.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/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 4bd0a104431602f65d67040bef1f743648c257ee ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:29,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:29,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:29,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:29,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:29,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:29,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:29,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:29,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:29,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:29,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:29,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:29,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:29,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:29,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:29,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:29,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:29,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:29,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:29,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:29,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:29,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:29,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:29,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:29,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:29,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:29,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:29,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:29,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:29,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:29,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:29,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:29,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:29,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:29,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:29,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:29,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:29,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:29,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:29,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:29,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:29,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:29,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:29,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:29,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:29,199 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:29,199 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:29,203 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:29,203 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:29,203 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:29,204 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:29,204 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:29,204 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:29,204 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:29,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:29,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:29,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:29,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:29,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:29,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:29,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:29,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:29,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:29,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:29,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:29,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:29,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:29,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:29,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:29,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:29,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:29,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:29,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:29,208 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:29,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:29,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:29,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:29,209 INFO L138 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_0abad68d-b97b-4c79-90e2-2c7520343210/bin/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 -> 4bd0a104431602f65d67040bef1f743648c257ee [2019-10-22 11:21:29,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:29,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:29,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:29,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:29,263 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:29,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/../../sv-benchmarks/c/pthread-ext/20_lamport.i [2019-10-22 11:21:29,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/data/bd1d8a6de/2584983a625b447b958888008d90df46/FLAG99d96c2b5 [2019-10-22 11:21:29,774 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:29,775 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/sv-benchmarks/c/pthread-ext/20_lamport.i [2019-10-22 11:21:29,785 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/data/bd1d8a6de/2584983a625b447b958888008d90df46/FLAG99d96c2b5 [2019-10-22 11:21:30,283 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/data/bd1d8a6de/2584983a625b447b958888008d90df46 [2019-10-22 11:21:30,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:30,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:30,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:30,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:30,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:30,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a956d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30, skipping insertion in model container [2019-10-22 11:21:30,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,301 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:30,332 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:30,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:30,759 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:30,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:30,861 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:30,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30 WrapperNode [2019-10-22 11:21:30,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:30,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:30,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:30,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:30,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:30,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:30,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:30,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:30,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... [2019-10-22 11:21:30,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:30,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:30,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:30,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:30,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/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 [2019-10-22 11:21:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-10-22 11:21:30,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-10-22 11:21:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:30,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:30,980 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 11:21:31,269 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:31,269 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-10-22 11:21:31,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:31 BoogieIcfgContainer [2019-10-22 11:21:31,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:31,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:31,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:31,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:31,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:30" (1/3) ... [2019-10-22 11:21:31,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180bc9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:31, skipping insertion in model container [2019-10-22 11:21:31,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:30" (2/3) ... [2019-10-22 11:21:31,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180bc9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:31, skipping insertion in model container [2019-10-22 11:21:31,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:31" (3/3) ... [2019-10-22 11:21:31,277 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-10-22 11:21:31,304 WARN L315 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:31,304 WARN L315 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:31,304 WARN L315 ript$VariableManager]: TermVariabe Thread0_thr1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:31,304 WARN L315 ript$VariableManager]: TermVariabe Thread0_thr1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:31,305 WARN L315 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:31,305 WARN L315 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:31,312 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 11:21:31,312 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:31,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:21:31,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:21:31,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:31,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:31,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:31,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:31,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:31,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:31,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:31,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:31,363 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 90 transitions [2019-10-22 11:21:31,432 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 771 states. [2019-10-22 11:21:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states. [2019-10-22 11:21:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:31,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:31,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:31,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1219876355, now seen corresponding path program 1 times [2019-10-22 11:21:31,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:31,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847692650] [2019-10-22 11:21:31,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:31,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:31,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:31,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847692650] [2019-10-22 11:21:31,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:31,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:31,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558553874] [2019-10-22 11:21:31,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:21:31,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:31,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:21:31,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:31,623 INFO L87 Difference]: Start difference. First operand 771 states. Second operand 2 states. [2019-10-22 11:21:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:31,672 INFO L93 Difference]: Finished difference Result 771 states and 1810 transitions. [2019-10-22 11:21:31,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:21:31,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-22 11:21:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:31,698 INFO L225 Difference]: With dead ends: 771 [2019-10-22 11:21:31,698 INFO L226 Difference]: Without dead ends: 716 [2019-10-22 11:21:31,700 INFO L600 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 [2019-10-22 11:21:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-22 11:21:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-10-22 11:21:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-10-22 11:21:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1700 transitions. [2019-10-22 11:21:31,795 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1700 transitions. Word has length 17 [2019-10-22 11:21:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:31,795 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1700 transitions. [2019-10-22 11:21:31,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:21:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1700 transitions. [2019-10-22 11:21:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:31,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:31,797 INFO L380 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] [2019-10-22 11:21:31,798 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash 666702359, now seen corresponding path program 1 times [2019-10-22 11:21:31,798 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:31,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406227919] [2019-10-22 11:21:31,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:31,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:31,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406227919] [2019-10-22 11:21:31,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:31,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:31,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220638960] [2019-10-22 11:21:31,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:31,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:31,882 INFO L87 Difference]: Start difference. First operand 716 states and 1700 transitions. Second operand 3 states. [2019-10-22 11:21:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:31,933 INFO L93 Difference]: Finished difference Result 707 states and 1649 transitions. [2019-10-22 11:21:31,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:31,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:21:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:31,937 INFO L225 Difference]: With dead ends: 707 [2019-10-22 11:21:31,938 INFO L226 Difference]: Without dead ends: 531 [2019-10-22 11:21:31,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-22 11:21:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 516. [2019-10-22 11:21:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-22 11:21:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1221 transitions. [2019-10-22 11:21:31,984 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1221 transitions. Word has length 23 [2019-10-22 11:21:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:31,984 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 1221 transitions. [2019-10-22 11:21:31,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1221 transitions. [2019-10-22 11:21:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:21:31,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:31,986 INFO L380 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] [2019-10-22 11:21:31,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1095347577, now seen corresponding path program 1 times [2019-10-22 11:21:31,987 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:31,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665167082] [2019-10-22 11:21:31,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:31,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:31,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665167082] [2019-10-22 11:21:32,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:32,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986004063] [2019-10-22 11:21:32,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,057 INFO L87 Difference]: Start difference. First operand 516 states and 1221 transitions. Second operand 3 states. [2019-10-22 11:21:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,075 INFO L93 Difference]: Finished difference Result 485 states and 1140 transitions. [2019-10-22 11:21:32,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 11:21:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,078 INFO L225 Difference]: With dead ends: 485 [2019-10-22 11:21:32,078 INFO L226 Difference]: Without dead ends: 385 [2019-10-22 11:21:32,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-22 11:21:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-10-22 11:21:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-10-22 11:21:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 916 transitions. [2019-10-22 11:21:32,089 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 916 transitions. Word has length 27 [2019-10-22 11:21:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,089 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 916 transitions. [2019-10-22 11:21:32,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 916 transitions. [2019-10-22 11:21:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:32,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,092 INFO L380 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] [2019-10-22 11:21:32,092 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1294731827, now seen corresponding path program 1 times [2019-10-22 11:21:32,092 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318282065] [2019-10-22 11:21:32,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318282065] [2019-10-22 11:21:32,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:32,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150070865] [2019-10-22 11:21:32,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,164 INFO L87 Difference]: Start difference. First operand 385 states and 916 transitions. Second operand 3 states. [2019-10-22 11:21:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,250 INFO L93 Difference]: Finished difference Result 494 states and 1165 transitions. [2019-10-22 11:21:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:21:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,256 INFO L225 Difference]: With dead ends: 494 [2019-10-22 11:21:32,256 INFO L226 Difference]: Without dead ends: 407 [2019-10-22 11:21:32,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-22 11:21:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 390. [2019-10-22 11:21:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-22 11:21:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 902 transitions. [2019-10-22 11:21:32,270 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 902 transitions. Word has length 36 [2019-10-22 11:21:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,270 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 902 transitions. [2019-10-22 11:21:32,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 902 transitions. [2019-10-22 11:21:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:32,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,276 INFO L380 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] [2019-10-22 11:21:32,277 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash -415710077, now seen corresponding path program 2 times [2019-10-22 11:21:32,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097123806] [2019-10-22 11:21:32,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097123806] [2019-10-22 11:21:32,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:32,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213493468] [2019-10-22 11:21:32,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,342 INFO L87 Difference]: Start difference. First operand 390 states and 902 transitions. Second operand 3 states. [2019-10-22 11:21:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,368 INFO L93 Difference]: Finished difference Result 570 states and 1234 transitions. [2019-10-22 11:21:32,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:21:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,371 INFO L225 Difference]: With dead ends: 570 [2019-10-22 11:21:32,371 INFO L226 Difference]: Without dead ends: 570 [2019-10-22 11:21:32,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-22 11:21:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 411. [2019-10-22 11:21:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-22 11:21:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 930 transitions. [2019-10-22 11:21:32,384 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 930 transitions. Word has length 36 [2019-10-22 11:21:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,384 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 930 transitions. [2019-10-22 11:21:32,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 930 transitions. [2019-10-22 11:21:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:32,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,389 INFO L380 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] [2019-10-22 11:21:32,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1163711037, now seen corresponding path program 3 times [2019-10-22 11:21:32,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748503116] [2019-10-22 11:21:32,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748503116] [2019-10-22 11:21:32,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:32,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378004173] [2019-10-22 11:21:32,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:32,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:32,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:32,447 INFO L87 Difference]: Start difference. First operand 411 states and 930 transitions. Second operand 4 states. [2019-10-22 11:21:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,470 INFO L93 Difference]: Finished difference Result 503 states and 1037 transitions. [2019-10-22 11:21:32,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 11:21:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,473 INFO L225 Difference]: With dead ends: 503 [2019-10-22 11:21:32,473 INFO L226 Difference]: Without dead ends: 500 [2019-10-22 11:21:32,473 INFO L600 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 [2019-10-22 11:21:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-22 11:21:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 384. [2019-10-22 11:21:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-22 11:21:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 823 transitions. [2019-10-22 11:21:32,483 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 823 transitions. Word has length 36 [2019-10-22 11:21:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,484 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 823 transitions. [2019-10-22 11:21:32,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 823 transitions. [2019-10-22 11:21:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:32,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,486 INFO L380 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] [2019-10-22 11:21:32,486 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,486 INFO L82 PathProgramCache]: Analyzing trace with hash 986871566, now seen corresponding path program 1 times [2019-10-22 11:21:32,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953220858] [2019-10-22 11:21:32,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953220858] [2019-10-22 11:21:32,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:32,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929968690] [2019-10-22 11:21:32,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,533 INFO L87 Difference]: Start difference. First operand 384 states and 823 transitions. Second operand 3 states. [2019-10-22 11:21:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,583 INFO L93 Difference]: Finished difference Result 343 states and 668 transitions. [2019-10-22 11:21:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:21:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,585 INFO L225 Difference]: With dead ends: 343 [2019-10-22 11:21:32,585 INFO L226 Difference]: Without dead ends: 265 [2019-10-22 11:21:32,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-22 11:21:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 236. [2019-10-22 11:21:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-22 11:21:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 446 transitions. [2019-10-22 11:21:32,592 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 446 transitions. Word has length 36 [2019-10-22 11:21:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,594 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 446 transitions. [2019-10-22 11:21:32,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 446 transitions. [2019-10-22 11:21:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:21:32,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,596 INFO L380 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] [2019-10-22 11:21:32,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1794215882, now seen corresponding path program 1 times [2019-10-22 11:21:32,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229734314] [2019-10-22 11:21:32,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229734314] [2019-10-22 11:21:32,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:32,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479563011] [2019-10-22 11:21:32,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,647 INFO L87 Difference]: Start difference. First operand 236 states and 446 transitions. Second operand 3 states. [2019-10-22 11:21:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,656 INFO L93 Difference]: Finished difference Result 228 states and 430 transitions. [2019-10-22 11:21:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:21:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,658 INFO L225 Difference]: With dead ends: 228 [2019-10-22 11:21:32,658 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 11:21:32,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 11:21:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-10-22 11:21:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-22 11:21:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 385 transitions. [2019-10-22 11:21:32,664 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 385 transitions. Word has length 39 [2019-10-22 11:21:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,665 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 385 transitions. [2019-10-22 11:21:32,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 385 transitions. [2019-10-22 11:21:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:21:32,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:32,667 INFO L380 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] [2019-10-22 11:21:32,667 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1082705645, now seen corresponding path program 1 times [2019-10-22 11:21:32,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:32,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208182629] [2019-10-22 11:21:32,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:32,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:32,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208182629] [2019-10-22 11:21:32,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:32,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:32,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95934666] [2019-10-22 11:21:32,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:32,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,705 INFO L87 Difference]: Start difference. First operand 204 states and 385 transitions. Second operand 3 states. [2019-10-22 11:21:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:32,712 INFO L93 Difference]: Finished difference Result 139 states and 281 transitions. [2019-10-22 11:21:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:32,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:21:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:32,713 INFO L225 Difference]: With dead ends: 139 [2019-10-22 11:21:32,713 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:32,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:32,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-10-22 11:21:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:32,715 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:32,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:32,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:32,718 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:21:32,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:32 BasicIcfg [2019-10-22 11:21:32,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:32,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:32,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:32,727 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:32,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:31" (3/4) ... [2019-10-22 11:21:32,730 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:32,737 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-10-22 11:21:32,742 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 11:21:32,743 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:21:32,782 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0abad68d-b97b-4c79-90e2-2c7520343210/bin/utaipan/witness.graphml [2019-10-22 11:21:32,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:32,787 INFO L168 Benchmark]: Toolchain (without parser) took 2499.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 937.0 MB in the beginning and 918.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 144.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:32,788 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:32,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:32,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.31 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:32,789 INFO L168 Benchmark]: Boogie Preprocessor took 30.19 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. [2019-10-22 11:21:32,789 INFO L168 Benchmark]: RCFGBuilder took 337.59 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:32,794 INFO L168 Benchmark]: TraceAbstraction took 1448.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 146.2 MB). Peak memory consumption was 146.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:32,794 INFO L168 Benchmark]: Witness Printer took 58.74 ms. Allocated memory is still 1.2 GB. Free memory is still 918.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:32,796 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 574.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.31 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.19 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 337.59 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1448.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 146.2 MB). Peak memory consumption was 146.2 MB. Max. memory is 11.5 GB. * Witness Printer took 58.74 ms. Allocated memory is still 1.2 GB. Free memory is still 918.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 724]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 698]: 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. Result: SAFE, OverallTime: 1.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 774 SDtfs, 285 SDslu, 497 SDs, 0 SdLazy, 92 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 12436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...