./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/20_lamport.i -s /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/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.25-f470102 [2019-12-07 20:26:00,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:26:00,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:26:00,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:26:00,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:26:00,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:26:00,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:26:00,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:26:00,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:26:00,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:26:00,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:26:00,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:26:00,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:26:00,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:26:00,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:26:00,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:26:00,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:26:00,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:26:00,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:26:00,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:26:00,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:26:00,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:26:00,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:26:00,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:26:00,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:26:00,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:26:00,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:26:00,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:26:00,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:26:00,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:26:00,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:26:00,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:26:00,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:26:00,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:26:00,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:26:00,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:26:00,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:26:00,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:26:00,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:26:00,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:26:00,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:26:00,155 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:26:00,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:26:00,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:26:00,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:26:00,168 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:26:00,168 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:26:00,169 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:26:00,170 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:26:00,170 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:26:00,170 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:26:00,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:26:00,171 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:26:00,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:26:00,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:26:00,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:26:00,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:26:00,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:26:00,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:26:00,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:26:00,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:26:00,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:26:00,173 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/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/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-12-07 20:26:00,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:26:00,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:26:00,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:26:00,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:26:00,292 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:26:00,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/../../sv-benchmarks/c/pthread-ext/20_lamport.i [2019-12-07 20:26:00,338 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/data/cf746a710/38ca425c396948efb883e514fe6b2f21/FLAGc1c3231fa [2019-12-07 20:26:00,787 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:26:00,787 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/sv-benchmarks/c/pthread-ext/20_lamport.i [2019-12-07 20:26:00,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/data/cf746a710/38ca425c396948efb883e514fe6b2f21/FLAGc1c3231fa [2019-12-07 20:26:00,805 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/data/cf746a710/38ca425c396948efb883e514fe6b2f21 [2019-12-07 20:26:00,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:26:00,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:26:00,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:26:00,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:26:00,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:26:00,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:26:00" (1/1) ... [2019-12-07 20:26:00,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbf18cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:00, skipping insertion in model container [2019-12-07 20:26:00,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:26:00" (1/1) ... [2019-12-07 20:26:00,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:26:00,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:26:01,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:26:01,100 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:26:01,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:26:01,191 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:26:01,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01 WrapperNode [2019-12-07 20:26:01,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:26:01,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:26:01,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:26:01,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:26:01,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:26:01,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:26:01,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:26:01,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:26:01,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... [2019-12-07 20:26:01,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:26:01,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:26:01,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:26:01,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:26:01,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/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-12-07 20:26:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-07 20:26:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-07 20:26:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:26:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:26:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:26:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:26:01,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:26:01,286 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:26:01,471 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:26:01,471 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-07 20:26:01,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:26:01 BoogieIcfgContainer [2019-12-07 20:26:01,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:26:01,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:26:01,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:26:01,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:26:01,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:26:00" (1/3) ... [2019-12-07 20:26:01,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d3ed18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:26:01, skipping insertion in model container [2019-12-07 20:26:01,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:01" (2/3) ... [2019-12-07 20:26:01,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d3ed18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:26:01, skipping insertion in model container [2019-12-07 20:26:01,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:26:01" (3/3) ... [2019-12-07 20:26:01,477 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-12-07 20:26:01,484 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:26:01,484 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:26:01,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:26:01,488 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:26:01,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:26:01,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:26:01,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:26:01,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:26:01,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:26:01,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:26:01,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 20:26:01,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:26:01,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:26:01,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:26:01,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:26:01,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:26:01,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:26:01,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:26:01,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:26:01,538 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions [2019-12-07 20:26:01,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-07 20:26:01,568 INFO L134 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-07 20:26:01,568 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:26:01,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs. 3/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-12-07 20:26:01,576 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-07 20:26:01,589 INFO L134 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-07 20:26:01,590 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:26:01,591 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs. 3/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-12-07 20:26:01,593 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2992 [2019-12-07 20:26:01,594 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:26:02,289 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7520 [2019-12-07 20:26:02,289 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-07 20:26:02,292 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 51 transitions [2019-12-07 20:26:02,317 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 291 states. [2019-12-07 20:26:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states. [2019-12-07 20:26:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:26:02,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:26:02,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash 12384667, now seen corresponding path program 1 times [2019-12-07 20:26:02,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91819587] [2019-12-07 20:26:02,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91819587] [2019-12-07 20:26:02,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:26:02,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070385570] [2019-12-07 20:26:02,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 20:26:02,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 20:26:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:26:02,449 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 2 states. [2019-12-07 20:26:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,469 INFO L93 Difference]: Finished difference Result 291 states and 750 transitions. [2019-12-07 20:26:02,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:26:02,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 20:26:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,480 INFO L225 Difference]: With dead ends: 291 [2019-12-07 20:26:02,480 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 20:26:02,481 INFO L630 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-12-07 20:26:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 20:26:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-12-07 20:26:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 20:26:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 732 transitions. [2019-12-07 20:26:02,525 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 732 transitions. Word has length 4 [2019-12-07 20:26:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,526 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 732 transitions. [2019-12-07 20:26:02,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 20:26:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 732 transitions. [2019-12-07 20:26:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:26:02,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 27980612, now seen corresponding path program 1 times [2019-12-07 20:26:02,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691665041] [2019-12-07 20:26:02,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691665041] [2019-12-07 20:26:02,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:26:02,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647094960] [2019-12-07 20:26:02,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,570 INFO L87 Difference]: Start difference. First operand 282 states and 732 transitions. Second operand 3 states. [2019-12-07 20:26:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,589 INFO L93 Difference]: Finished difference Result 281 states and 714 transitions. [2019-12-07 20:26:02,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:26:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,592 INFO L225 Difference]: With dead ends: 281 [2019-12-07 20:26:02,592 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 20:26:02,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 20:26:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 20:26:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-12-07 20:26:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 20:26:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 615 transitions. [2019-12-07 20:26:02,612 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 615 transitions. Word has length 9 [2019-12-07 20:26:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,612 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 615 transitions. [2019-12-07 20:26:02,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 615 transitions. [2019-12-07 20:26:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:26:02,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,613 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1037274544, now seen corresponding path program 1 times [2019-12-07 20:26:02,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231686086] [2019-12-07 20:26:02,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231686086] [2019-12-07 20:26:02,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:26:02,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513992379] [2019-12-07 20:26:02,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,644 INFO L87 Difference]: Start difference. First operand 236 states and 615 transitions. Second operand 3 states. [2019-12-07 20:26:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,660 INFO L93 Difference]: Finished difference Result 225 states and 582 transitions. [2019-12-07 20:26:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:26:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,662 INFO L225 Difference]: With dead ends: 225 [2019-12-07 20:26:02,662 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 20:26:02,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 20:26:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 20:26:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-12-07 20:26:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 20:26:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 490 transitions. [2019-12-07 20:26:02,673 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 490 transitions. Word has length 9 [2019-12-07 20:26:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,673 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 490 transitions. [2019-12-07 20:26:02,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 490 transitions. [2019-12-07 20:26:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:26:02,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1540220195, now seen corresponding path program 1 times [2019-12-07 20:26:02,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941676072] [2019-12-07 20:26:02,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941676072] [2019-12-07 20:26:02,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:02,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484356838] [2019-12-07 20:26:02,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,716 INFO L87 Difference]: Start difference. First operand 186 states and 490 transitions. Second operand 3 states. [2019-12-07 20:26:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,736 INFO L93 Difference]: Finished difference Result 308 states and 768 transitions. [2019-12-07 20:26:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:26:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,738 INFO L225 Difference]: With dead ends: 308 [2019-12-07 20:26:02,739 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 20:26:02,739 INFO L630 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-12-07 20:26:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 20:26:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 229. [2019-12-07 20:26:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-12-07 20:26:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 602 transitions. [2019-12-07 20:26:02,747 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 602 transitions. Word has length 15 [2019-12-07 20:26:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,747 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 602 transitions. [2019-12-07 20:26:02,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 602 transitions. [2019-12-07 20:26:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:26:02,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash 988190489, now seen corresponding path program 1 times [2019-12-07 20:26:02,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574000191] [2019-12-07 20:26:02,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574000191] [2019-12-07 20:26:02,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:02,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081506573] [2019-12-07 20:26:02,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,772 INFO L87 Difference]: Start difference. First operand 229 states and 602 transitions. Second operand 3 states. [2019-12-07 20:26:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,803 INFO L93 Difference]: Finished difference Result 312 states and 770 transitions. [2019-12-07 20:26:02,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:26:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,805 INFO L225 Difference]: With dead ends: 312 [2019-12-07 20:26:02,805 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 20:26:02,805 INFO L630 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-12-07 20:26:02,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 20:26:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2019-12-07 20:26:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 20:26:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 534 transitions. [2019-12-07 20:26:02,811 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 534 transitions. Word has length 15 [2019-12-07 20:26:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,811 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 534 transitions. [2019-12-07 20:26:02,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 534 transitions. [2019-12-07 20:26:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:26:02,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -795157281, now seen corresponding path program 2 times [2019-12-07 20:26:02,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14471575] [2019-12-07 20:26:02,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14471575] [2019-12-07 20:26:02,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:02,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886467355] [2019-12-07 20:26:02,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,830 INFO L87 Difference]: Start difference. First operand 216 states and 534 transitions. Second operand 3 states. [2019-12-07 20:26:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,839 INFO L93 Difference]: Finished difference Result 293 states and 674 transitions. [2019-12-07 20:26:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:26:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,841 INFO L225 Difference]: With dead ends: 293 [2019-12-07 20:26:02,841 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 20:26:02,842 INFO L630 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-12-07 20:26:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 20:26:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 216. [2019-12-07 20:26:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 20:26:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 522 transitions. [2019-12-07 20:26:02,848 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 522 transitions. Word has length 15 [2019-12-07 20:26:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,849 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 522 transitions. [2019-12-07 20:26:02,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 522 transitions. [2019-12-07 20:26:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:26:02,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,850 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1884700835, now seen corresponding path program 2 times [2019-12-07 20:26:02,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133329217] [2019-12-07 20:26:02,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133329217] [2019-12-07 20:26:02,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:02,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299931601] [2019-12-07 20:26:02,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,872 INFO L87 Difference]: Start difference. First operand 216 states and 522 transitions. Second operand 3 states. [2019-12-07 20:26:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,894 INFO L93 Difference]: Finished difference Result 181 states and 375 transitions. [2019-12-07 20:26:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:26:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,895 INFO L225 Difference]: With dead ends: 181 [2019-12-07 20:26:02,896 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 20:26:02,896 INFO L630 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-12-07 20:26:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 20:26:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-12-07 20:26:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 20:26:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 190 transitions. [2019-12-07 20:26:02,898 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 190 transitions. Word has length 15 [2019-12-07 20:26:02,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,898 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 190 transitions. [2019-12-07 20:26:02,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 190 transitions. [2019-12-07 20:26:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:26:02,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,899 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1567500834, now seen corresponding path program 1 times [2019-12-07 20:26:02,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977125011] [2019-12-07 20:26:02,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977125011] [2019-12-07 20:26:02,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:02,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716910439] [2019-12-07 20:26:02,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,917 INFO L87 Difference]: Start difference. First operand 96 states and 190 transitions. Second operand 3 states. [2019-12-07 20:26:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,926 INFO L93 Difference]: Finished difference Result 98 states and 191 transitions. [2019-12-07 20:26:02,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 20:26:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,927 INFO L225 Difference]: With dead ends: 98 [2019-12-07 20:26:02,927 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 20:26:02,927 INFO L630 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-12-07 20:26:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 20:26:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-07 20:26:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 20:26:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 159 transitions. [2019-12-07 20:26:02,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 159 transitions. Word has length 17 [2019-12-07 20:26:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,929 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 159 transitions. [2019-12-07 20:26:02,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 159 transitions. [2019-12-07 20:26:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:26:02,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:02,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:02,930 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 322655978, now seen corresponding path program 1 times [2019-12-07 20:26:02,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:02,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316306000] [2019-12-07 20:26:02,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:02,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316306000] [2019-12-07 20:26:02,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:02,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:02,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109711400] [2019-12-07 20:26:02,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:02,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:02,947 INFO L87 Difference]: Start difference. First operand 81 states and 159 transitions. Second operand 3 states. [2019-12-07 20:26:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:02,951 INFO L93 Difference]: Finished difference Result 56 states and 119 transitions. [2019-12-07 20:26:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:02,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 20:26:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:02,952 INFO L225 Difference]: With dead ends: 56 [2019-12-07 20:26:02,952 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:26:02,952 INFO L630 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-12-07 20:26:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:26:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:26:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:26:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:26:02,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-12-07 20:26:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:02,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:26:02,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:26:02,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:26:02,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:26:02 BasicIcfg [2019-12-07 20:26:02,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:26:02,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:26:02,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:26:02,956 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:26:02,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:26:01" (3/4) ... [2019-12-07 20:26:02,959 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:26:02,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-12-07 20:26:02,966 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 20:26:02,967 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 20:26:02,967 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:26:02,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_952b9fc2-cdfd-46b1-a9d6-92d06035eb57/bin/utaipan/witness.graphml [2019-12-07 20:26:02,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:26:02,995 INFO L168 Benchmark]: Toolchain (without parser) took 2186.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:02,995 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:26:02,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:02,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:02,996 INFO L168 Benchmark]: Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:26:02,996 INFO L168 Benchmark]: RCFGBuilder took 230.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:02,996 INFO L168 Benchmark]: TraceAbstraction took 1482.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:02,997 INFO L168 Benchmark]: Witness Printer took 37.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:02,998 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 230.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1482.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Witness Printer took 37.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 72 ProgramPointsBefore, 37 ProgramPointsAfterwards, 92 TransitionsBefore, 51 TransitionsAfterwards, 2992 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1205 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 50 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 7520 CheckedPairsTotal, 46 TotalNumberOfCompositions - 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 2 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 474 SDtfs, 189 SDslu, 211 SDs, 0 SdLazy, 96 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 200 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2461 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...