./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.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_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/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 aca05f1d1f58ff488982a08634d2bcecc662c5ab ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:27:23,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:23,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:23,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:23,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:23,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:23,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:23,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:23,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:23,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:23,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:23,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:23,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:23,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:23,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:23,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:23,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:23,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:23,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:23,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:23,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:23,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:23,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:23,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:23,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:23,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:23,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:23,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:23,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:23,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:23,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:23,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:23,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:23,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:23,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:23,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:23,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:23,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:23,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:23,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:23,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:23,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:23,317 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:23,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:23,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:23,327 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:23,328 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:23,328 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:23,328 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:23,328 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:23,328 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:23,328 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:23,328 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:23,329 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:23,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:23,329 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:23,330 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:23,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:23,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:23,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:23,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:23,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:23,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:23,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:23,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:23,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:23,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:23,332 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:23,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:23,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:23,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:23,333 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_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/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 -> aca05f1d1f58ff488982a08634d2bcecc662c5ab [2019-10-22 11:27:23,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:23,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:23,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:23,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:23,378 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:23,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-10-22 11:27:23,424 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/data/8433a5477/3d5affbd477246e98e93bb9e680bb89b/FLAGa07d2cef6 [2019-10-22 11:27:23,897 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:23,900 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-10-22 11:27:23,912 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/data/8433a5477/3d5affbd477246e98e93bb9e680bb89b/FLAGa07d2cef6 [2019-10-22 11:27:24,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/data/8433a5477/3d5affbd477246e98e93bb9e680bb89b [2019-10-22 11:27:24,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:24,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:24,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:24,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:24,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:24,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:24,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eafad64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24, skipping insertion in model container [2019-10-22 11:27:24,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:24,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:24,461 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:24,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:24,836 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:24,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:24,942 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:24,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24 WrapperNode [2019-10-22 11:27:24,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:24,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:24,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:24,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:24,951 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:27:24" (1/1) ... [2019-10-22 11:27:24,966 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:27:24" (1/1) ... [2019-10-22 11:27:24,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:24,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:24,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:24,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:24,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:24,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:25,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:25,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:25,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:25,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:25,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... [2019-10-22 11:27:25,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:25,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:25,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:25,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:25,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/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:27:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:27:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 11:27:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:27:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:27:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 11:27:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 11:27:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 11:27:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 11:27:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 11:27:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:25,090 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:27:25,608 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:25,608 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:27:25,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:25 BoogieIcfgContainer [2019-10-22 11:27:25,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:25,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:25,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:25,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:25,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:24" (1/3) ... [2019-10-22 11:27:25,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0d91c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:25, skipping insertion in model container [2019-10-22 11:27:25,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:24" (2/3) ... [2019-10-22 11:27:25,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0d91c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:25, skipping insertion in model container [2019-10-22 11:27:25,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:25" (3/3) ... [2019-10-22 11:27:25,616 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-10-22 11:27:25,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,652 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,652 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,669 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,673 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,673 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,674 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,674 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,674 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,674 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,674 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,675 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,675 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,675 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,675 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,675 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,675 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,676 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,677 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,677 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,677 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,681 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,681 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,681 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,681 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,681 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,681 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,682 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:25,693 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 11:27:25,693 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:25,701 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:27:25,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:27:25,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:25,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:25,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:25,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:25,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:25,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:25,729 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:25,729 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:25,737 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 163 transitions [2019-10-22 11:27:27,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2019-10-22 11:27:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2019-10-22 11:27:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 11:27:27,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:27,671 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] [2019-10-22 11:27:27,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -361473251, now seen corresponding path program 1 times [2019-10-22 11:27:27,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:27,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118741077] [2019-10-22 11:27:27,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:27,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:27,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:27,936 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:27:27,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118741077] [2019-10-22 11:27:27,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:27,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:27,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120905691] [2019-10-22 11:27:27,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:27,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:27,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:27,965 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2019-10-22 11:27:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:28,513 INFO L93 Difference]: Finished difference Result 28523 states and 108880 transitions. [2019-10-22 11:27:28,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:28,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-22 11:27:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:28,696 INFO L225 Difference]: With dead ends: 28523 [2019-10-22 11:27:28,696 INFO L226 Difference]: Without dead ends: 21755 [2019-10-22 11:27:28,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21755 states. [2019-10-22 11:27:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21755 to 21755. [2019-10-22 11:27:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2019-10-22 11:27:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2019-10-22 11:27:29,749 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2019-10-22 11:27:29,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:29,749 INFO L462 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2019-10-22 11:27:29,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2019-10-22 11:27:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:27:29,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:29,757 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:29,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1780861984, now seen corresponding path program 1 times [2019-10-22 11:27:29,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:29,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626828657] [2019-10-22 11:27:29,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:29,847 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:27:29,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626828657] [2019-10-22 11:27:29,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:29,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:29,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567712661] [2019-10-22 11:27:29,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:29,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:29,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:29,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:29,850 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2019-10-22 11:27:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:30,694 INFO L93 Difference]: Finished difference Result 34169 states and 124040 transitions. [2019-10-22 11:27:30,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:30,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 11:27:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:30,818 INFO L225 Difference]: With dead ends: 34169 [2019-10-22 11:27:30,818 INFO L226 Difference]: Without dead ends: 33601 [2019-10-22 11:27:30,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33601 states. [2019-10-22 11:27:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33601 to 31795. [2019-10-22 11:27:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-10-22 11:27:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2019-10-22 11:27:31,667 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2019-10-22 11:27:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,668 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2019-10-22 11:27:31,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2019-10-22 11:27:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:27:31,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,673 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:31,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash -379540766, now seen corresponding path program 1 times [2019-10-22 11:27:31,674 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083792857] [2019-10-22 11:27:31,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,780 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:27:31,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083792857] [2019-10-22 11:27:31,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:31,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814697655] [2019-10-22 11:27:31,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:31,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:31,782 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2019-10-22 11:27:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,530 INFO L93 Difference]: Finished difference Result 41643 states and 149742 transitions. [2019-10-22 11:27:32,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:32,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 11:27:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,664 INFO L225 Difference]: With dead ends: 41643 [2019-10-22 11:27:32,664 INFO L226 Difference]: Without dead ends: 41179 [2019-10-22 11:27:32,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41179 states. [2019-10-22 11:27:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41179 to 35363. [2019-10-22 11:27:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2019-10-22 11:27:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2019-10-22 11:27:33,916 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2019-10-22 11:27:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:33,916 INFO L462 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2019-10-22 11:27:33,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2019-10-22 11:27:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:27:33,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:33,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:33,928 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1216116808, now seen corresponding path program 1 times [2019-10-22 11:27:33,928 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:33,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857468898] [2019-10-22 11:27:33,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:33,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:33,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:33,983 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:27:33,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857468898] [2019-10-22 11:27:33,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:33,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:33,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269207680] [2019-10-22 11:27:33,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:33,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:33,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:33,987 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2019-10-22 11:27:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:34,170 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2019-10-22 11:27:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:34,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 11:27:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:34,333 INFO L225 Difference]: With dead ends: 45909 [2019-10-22 11:27:34,334 INFO L226 Difference]: Without dead ends: 45909 [2019-10-22 11:27:34,334 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:27:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2019-10-22 11:27:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2019-10-22 11:27:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2019-10-22 11:27:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2019-10-22 11:27:35,788 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2019-10-22 11:27:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:35,788 INFO L462 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2019-10-22 11:27:35,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2019-10-22 11:27:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:27:35,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:35,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:35,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash -518299885, now seen corresponding path program 1 times [2019-10-22 11:27:35,799 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:35,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403348850] [2019-10-22 11:27:35,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:35,925 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:27:35,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403348850] [2019-10-22 11:27:35,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:35,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:35,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852607132] [2019-10-22 11:27:35,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:35,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:35,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:35,927 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2019-10-22 11:27:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,594 INFO L93 Difference]: Finished difference Result 52465 states and 185476 transitions. [2019-10-22 11:27:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:27:36,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 11:27:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,691 INFO L225 Difference]: With dead ends: 52465 [2019-10-22 11:27:36,691 INFO L226 Difference]: Without dead ends: 51929 [2019-10-22 11:27:36,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:27:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51929 states. [2019-10-22 11:27:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51929 to 40897. [2019-10-22 11:27:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2019-10-22 11:27:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2019-10-22 11:27:37,396 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2019-10-22 11:27:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,396 INFO L462 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2019-10-22 11:27:37,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2019-10-22 11:27:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:27:37,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:37,411 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -173831608, now seen corresponding path program 1 times [2019-10-22 11:27:37,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509302534] [2019-10-22 11:27:37,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,508 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:27:37,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509302534] [2019-10-22 11:27:37,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:37,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955010252] [2019-10-22 11:27:37,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:37,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:37,509 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2019-10-22 11:27:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:38,711 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2019-10-22 11:27:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:38,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 11:27:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:38,823 INFO L225 Difference]: With dead ends: 56598 [2019-10-22 11:27:38,824 INFO L226 Difference]: Without dead ends: 55459 [2019-10-22 11:27:38,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2019-10-22 11:27:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2019-10-22 11:27:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2019-10-22 11:27:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2019-10-22 11:27:39,722 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2019-10-22 11:27:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:39,722 INFO L462 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2019-10-22 11:27:39,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2019-10-22 11:27:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:27:39,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:39,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:39,738 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1970782967, now seen corresponding path program 1 times [2019-10-22 11:27:39,738 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:39,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898448918] [2019-10-22 11:27:39,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:39,827 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:27:39,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898448918] [2019-10-22 11:27:39,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:39,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:27:39,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139289956] [2019-10-22 11:27:39,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:27:39,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:27:39,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:39,828 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2019-10-22 11:27:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:41,213 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2019-10-22 11:27:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:27:41,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-22 11:27:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:41,330 INFO L225 Difference]: With dead ends: 75637 [2019-10-22 11:27:41,330 INFO L226 Difference]: Without dead ends: 75637 [2019-10-22 11:27:41,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:27:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2019-10-22 11:27:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2019-10-22 11:27:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2019-10-22 11:27:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2019-10-22 11:27:42,328 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2019-10-22 11:27:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:42,328 INFO L462 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2019-10-22 11:27:42,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:27:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2019-10-22 11:27:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:27:42,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:42,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:42,338 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1083279286, now seen corresponding path program 1 times [2019-10-22 11:27:42,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:42,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680548274] [2019-10-22 11:27:42,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:42,391 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:27:42,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680548274] [2019-10-22 11:27:42,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:42,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:42,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504267097] [2019-10-22 11:27:42,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:42,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:42,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:42,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:42,392 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 3 states. [2019-10-22 11:27:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:42,547 INFO L93 Difference]: Finished difference Result 46766 states and 162433 transitions. [2019-10-22 11:27:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:42,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-22 11:27:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:42,625 INFO L225 Difference]: With dead ends: 46766 [2019-10-22 11:27:42,626 INFO L226 Difference]: Without dead ends: 46186 [2019-10-22 11:27:42,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46186 states. [2019-10-22 11:27:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46186 to 44421. [2019-10-22 11:27:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44421 states. [2019-10-22 11:27:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44421 states to 44421 states and 155154 transitions. [2019-10-22 11:27:43,630 INFO L78 Accepts]: Start accepts. Automaton has 44421 states and 155154 transitions. Word has length 53 [2019-10-22 11:27:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:43,630 INFO L462 AbstractCegarLoop]: Abstraction has 44421 states and 155154 transitions. [2019-10-22 11:27:43,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 44421 states and 155154 transitions. [2019-10-22 11:27:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:27:43,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:43,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:43,638 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash -866519067, now seen corresponding path program 1 times [2019-10-22 11:27:43,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:43,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988466694] [2019-10-22 11:27:43,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:43,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:43,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:43,738 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:27:43,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988466694] [2019-10-22 11:27:43,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:43,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:43,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141071241] [2019-10-22 11:27:43,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:43,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:43,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:43,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:43,739 INFO L87 Difference]: Start difference. First operand 44421 states and 155154 transitions. Second operand 6 states. [2019-10-22 11:27:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:44,297 INFO L93 Difference]: Finished difference Result 58723 states and 198369 transitions. [2019-10-22 11:27:44,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:44,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-22 11:27:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:44,387 INFO L225 Difference]: With dead ends: 58723 [2019-10-22 11:27:44,387 INFO L226 Difference]: Without dead ends: 58723 [2019-10-22 11:27:44,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58723 states. [2019-10-22 11:27:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58723 to 48777. [2019-10-22 11:27:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48777 states. [2019-10-22 11:27:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48777 states to 48777 states and 167870 transitions. [2019-10-22 11:27:45,114 INFO L78 Accepts]: Start accepts. Automaton has 48777 states and 167870 transitions. Word has length 54 [2019-10-22 11:27:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:45,115 INFO L462 AbstractCegarLoop]: Abstraction has 48777 states and 167870 transitions. [2019-10-22 11:27:45,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 48777 states and 167870 transitions. [2019-10-22 11:27:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:27:45,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:45,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:45,122 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 20984614, now seen corresponding path program 1 times [2019-10-22 11:27:45,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:45,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106078416] [2019-10-22 11:27:45,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:45,218 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:27:45,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106078416] [2019-10-22 11:27:45,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:45,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:45,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607447232] [2019-10-22 11:27:45,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:45,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:45,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:45,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:45,219 INFO L87 Difference]: Start difference. First operand 48777 states and 167870 transitions. Second operand 5 states. [2019-10-22 11:27:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:45,297 INFO L93 Difference]: Finished difference Result 10151 states and 31521 transitions. [2019-10-22 11:27:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:45,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-22 11:27:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:45,315 INFO L225 Difference]: With dead ends: 10151 [2019-10-22 11:27:45,315 INFO L226 Difference]: Without dead ends: 8645 [2019-10-22 11:27:45,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2019-10-22 11:27:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 8597. [2019-10-22 11:27:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8597 states. [2019-10-22 11:27:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8597 states to 8597 states and 26466 transitions. [2019-10-22 11:27:45,444 INFO L78 Accepts]: Start accepts. Automaton has 8597 states and 26466 transitions. Word has length 54 [2019-10-22 11:27:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:45,444 INFO L462 AbstractCegarLoop]: Abstraction has 8597 states and 26466 transitions. [2019-10-22 11:27:45,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8597 states and 26466 transitions. [2019-10-22 11:27:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:27:45,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:45,449 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, 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:27:45,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1785283345, now seen corresponding path program 1 times [2019-10-22 11:27:45,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:45,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111137169] [2019-10-22 11:27:45,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:45,486 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:27:45,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111137169] [2019-10-22 11:27:45,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:45,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:45,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865822076] [2019-10-22 11:27:45,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:45,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:45,487 INFO L87 Difference]: Start difference. First operand 8597 states and 26466 transitions. Second operand 4 states. [2019-10-22 11:27:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:45,606 INFO L93 Difference]: Finished difference Result 10216 states and 31173 transitions. [2019-10-22 11:27:45,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:45,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:27:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:45,623 INFO L225 Difference]: With dead ends: 10216 [2019-10-22 11:27:45,623 INFO L226 Difference]: Without dead ends: 10216 [2019-10-22 11:27:45,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10216 states. [2019-10-22 11:27:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10216 to 9248. [2019-10-22 11:27:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2019-10-22 11:27:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 28327 transitions. [2019-10-22 11:27:45,802 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 28327 transitions. Word has length 63 [2019-10-22 11:27:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:45,802 INFO L462 AbstractCegarLoop]: Abstraction has 9248 states and 28327 transitions. [2019-10-22 11:27:45,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 28327 transitions. [2019-10-22 11:27:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:27:45,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:45,808 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, 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:27:45,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash -766873616, now seen corresponding path program 1 times [2019-10-22 11:27:45,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:45,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899564335] [2019-10-22 11:27:45,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:45,865 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:27:45,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899564335] [2019-10-22 11:27:45,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:45,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:45,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960804547] [2019-10-22 11:27:45,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:45,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:45,866 INFO L87 Difference]: Start difference. First operand 9248 states and 28327 transitions. Second operand 6 states. [2019-10-22 11:27:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:46,182 INFO L93 Difference]: Finished difference Result 12021 states and 36326 transitions. [2019-10-22 11:27:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:27:46,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-10-22 11:27:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:46,197 INFO L225 Difference]: With dead ends: 12021 [2019-10-22 11:27:46,197 INFO L226 Difference]: Without dead ends: 11957 [2019-10-22 11:27:46,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:27:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11957 states. [2019-10-22 11:27:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11957 to 10329. [2019-10-22 11:27:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10329 states. [2019-10-22 11:27:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10329 states to 10329 states and 31496 transitions. [2019-10-22 11:27:46,315 INFO L78 Accepts]: Start accepts. Automaton has 10329 states and 31496 transitions. Word has length 63 [2019-10-22 11:27:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:46,316 INFO L462 AbstractCegarLoop]: Abstraction has 10329 states and 31496 transitions. [2019-10-22 11:27:46,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 10329 states and 31496 transitions. [2019-10-22 11:27:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:27:46,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:46,321 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, 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:27:46,321 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1471341924, now seen corresponding path program 1 times [2019-10-22 11:27:46,321 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:46,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180949394] [2019-10-22 11:27:46,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:46,370 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:27:46,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180949394] [2019-10-22 11:27:46,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:46,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:46,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413001022] [2019-10-22 11:27:46,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:46,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:46,371 INFO L87 Difference]: Start difference. First operand 10329 states and 31496 transitions. Second operand 4 states. [2019-10-22 11:27:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:46,582 INFO L93 Difference]: Finished difference Result 13757 states and 41436 transitions. [2019-10-22 11:27:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:46,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-10-22 11:27:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:46,596 INFO L225 Difference]: With dead ends: 13757 [2019-10-22 11:27:46,596 INFO L226 Difference]: Without dead ends: 13757 [2019-10-22 11:27:46,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13757 states. [2019-10-22 11:27:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13757 to 11596. [2019-10-22 11:27:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-10-22 11:27:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 35103 transitions. [2019-10-22 11:27:46,724 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 35103 transitions. Word has length 67 [2019-10-22 11:27:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:46,724 INFO L462 AbstractCegarLoop]: Abstraction has 11596 states and 35103 transitions. [2019-10-22 11:27:46,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 35103 transitions. [2019-10-22 11:27:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:27:46,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:46,731 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, 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:27:46,731 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash -226577443, now seen corresponding path program 1 times [2019-10-22 11:27:46,732 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:46,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837358610] [2019-10-22 11:27:46,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:46,827 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:27:46,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837358610] [2019-10-22 11:27:46,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:46,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:46,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587941785] [2019-10-22 11:27:46,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:46,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:46,828 INFO L87 Difference]: Start difference. First operand 11596 states and 35103 transitions. Second operand 6 states. [2019-10-22 11:27:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:47,178 INFO L93 Difference]: Finished difference Result 13089 states and 38914 transitions. [2019-10-22 11:27:47,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:47,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 11:27:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:47,195 INFO L225 Difference]: With dead ends: 13089 [2019-10-22 11:27:47,195 INFO L226 Difference]: Without dead ends: 13089 [2019-10-22 11:27:47,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13089 states. [2019-10-22 11:27:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13089 to 12733. [2019-10-22 11:27:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12733 states. [2019-10-22 11:27:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12733 states to 12733 states and 37973 transitions. [2019-10-22 11:27:47,334 INFO L78 Accepts]: Start accepts. Automaton has 12733 states and 37973 transitions. Word has length 67 [2019-10-22 11:27:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:47,334 INFO L462 AbstractCegarLoop]: Abstraction has 12733 states and 37973 transitions. [2019-10-22 11:27:47,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12733 states and 37973 transitions. [2019-10-22 11:27:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:27:47,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:47,342 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, 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:27:47,342 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1991180510, now seen corresponding path program 1 times [2019-10-22 11:27:47,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:47,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429779310] [2019-10-22 11:27:47,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:47,422 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:27:47,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429779310] [2019-10-22 11:27:47,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:47,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:47,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11011696] [2019-10-22 11:27:47,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:47,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:47,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:47,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:47,423 INFO L87 Difference]: Start difference. First operand 12733 states and 37973 transitions. Second operand 6 states. [2019-10-22 11:27:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:47,694 INFO L93 Difference]: Finished difference Result 15082 states and 43756 transitions. [2019-10-22 11:27:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:27:47,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 11:27:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:47,722 INFO L225 Difference]: With dead ends: 15082 [2019-10-22 11:27:47,722 INFO L226 Difference]: Without dead ends: 15082 [2019-10-22 11:27:47,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:27:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15082 states. [2019-10-22 11:27:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15082 to 12972. [2019-10-22 11:27:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12972 states. [2019-10-22 11:27:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 38017 transitions. [2019-10-22 11:27:47,869 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 38017 transitions. Word has length 67 [2019-10-22 11:27:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:47,870 INFO L462 AbstractCegarLoop]: Abstraction has 12972 states and 38017 transitions. [2019-10-22 11:27:47,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 38017 transitions. [2019-10-22 11:27:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:27:47,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:47,876 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, 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:27:47,876 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2092435873, now seen corresponding path program 1 times [2019-10-22 11:27:47,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:47,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400878189] [2019-10-22 11:27:47,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:47,949 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:27:47,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400878189] [2019-10-22 11:27:47,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:47,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:47,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220195261] [2019-10-22 11:27:47,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:47,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:47,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:47,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:47,950 INFO L87 Difference]: Start difference. First operand 12972 states and 38017 transitions. Second operand 5 states. [2019-10-22 11:27:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:48,178 INFO L93 Difference]: Finished difference Result 15977 states and 46601 transitions. [2019-10-22 11:27:48,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:27:48,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 11:27:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:48,204 INFO L225 Difference]: With dead ends: 15977 [2019-10-22 11:27:48,204 INFO L226 Difference]: Without dead ends: 15977 [2019-10-22 11:27:48,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-10-22 11:27:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 13915. [2019-10-22 11:27:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13915 states. [2019-10-22 11:27:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13915 states to 13915 states and 40447 transitions. [2019-10-22 11:27:48,415 INFO L78 Accepts]: Start accepts. Automaton has 13915 states and 40447 transitions. Word has length 67 [2019-10-22 11:27:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:48,416 INFO L462 AbstractCegarLoop]: Abstraction has 13915 states and 40447 transitions. [2019-10-22 11:27:48,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13915 states and 40447 transitions. [2019-10-22 11:27:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:27:48,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:48,424 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, 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:27:48,424 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1691997246, now seen corresponding path program 1 times [2019-10-22 11:27:48,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:48,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734033480] [2019-10-22 11:27:48,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:48,517 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:27:48,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734033480] [2019-10-22 11:27:48,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:48,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:48,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642822975] [2019-10-22 11:27:48,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:48,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:48,519 INFO L87 Difference]: Start difference. First operand 13915 states and 40447 transitions. Second operand 5 states. [2019-10-22 11:27:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:48,573 INFO L93 Difference]: Finished difference Result 5027 states and 12013 transitions. [2019-10-22 11:27:48,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:48,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 11:27:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:48,579 INFO L225 Difference]: With dead ends: 5027 [2019-10-22 11:27:48,579 INFO L226 Difference]: Without dead ends: 4034 [2019-10-22 11:27:48,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2019-10-22 11:27:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 3493. [2019-10-22 11:27:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2019-10-22 11:27:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 8121 transitions. [2019-10-22 11:27:48,627 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 8121 transitions. Word has length 67 [2019-10-22 11:27:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:48,627 INFO L462 AbstractCegarLoop]: Abstraction has 3493 states and 8121 transitions. [2019-10-22 11:27:48,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 8121 transitions. [2019-10-22 11:27:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:48,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:48,632 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:48,633 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 607090281, now seen corresponding path program 1 times [2019-10-22 11:27:48,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:48,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022319031] [2019-10-22 11:27:48,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:48,717 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:27:48,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022319031] [2019-10-22 11:27:48,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:48,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:48,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229668592] [2019-10-22 11:27:48,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:48,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:48,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:48,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:48,719 INFO L87 Difference]: Start difference. First operand 3493 states and 8121 transitions. Second operand 5 states. [2019-10-22 11:27:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:48,935 INFO L93 Difference]: Finished difference Result 4451 states and 10178 transitions. [2019-10-22 11:27:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:48,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-22 11:27:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:48,940 INFO L225 Difference]: With dead ends: 4451 [2019-10-22 11:27:48,940 INFO L226 Difference]: Without dead ends: 4417 [2019-10-22 11:27:48,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2019-10-22 11:27:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 3582. [2019-10-22 11:27:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3582 states. [2019-10-22 11:27:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 8299 transitions. [2019-10-22 11:27:48,992 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 8299 transitions. Word has length 84 [2019-10-22 11:27:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:48,992 INFO L462 AbstractCegarLoop]: Abstraction has 3582 states and 8299 transitions. [2019-10-22 11:27:48,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 8299 transitions. [2019-10-22 11:27:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:48,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:48,997 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:48,997 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:48,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2033161301, now seen corresponding path program 1 times [2019-10-22 11:27:48,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:48,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742522249] [2019-10-22 11:27:48,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:49,082 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:27:49,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742522249] [2019-10-22 11:27:49,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:49,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:27:49,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513352143] [2019-10-22 11:27:49,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:27:49,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:27:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:49,085 INFO L87 Difference]: Start difference. First operand 3582 states and 8299 transitions. Second operand 7 states. [2019-10-22 11:27:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:49,364 INFO L93 Difference]: Finished difference Result 4778 states and 10971 transitions. [2019-10-22 11:27:49,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:27:49,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 11:27:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:49,369 INFO L225 Difference]: With dead ends: 4778 [2019-10-22 11:27:49,370 INFO L226 Difference]: Without dead ends: 4778 [2019-10-22 11:27:49,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:27:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2019-10-22 11:27:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 3552. [2019-10-22 11:27:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-10-22 11:27:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 8237 transitions. [2019-10-22 11:27:49,406 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 8237 transitions. Word has length 84 [2019-10-22 11:27:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:49,406 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 8237 transitions. [2019-10-22 11:27:49,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:27:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 8237 transitions. [2019-10-22 11:27:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:49,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:49,409 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:49,409 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1339122412, now seen corresponding path program 1 times [2019-10-22 11:27:49,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:49,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665195609] [2019-10-22 11:27:49,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:49,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:49,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:49,469 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:27:49,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665195609] [2019-10-22 11:27:49,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:49,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:49,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145433856] [2019-10-22 11:27:49,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:49,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:49,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:49,471 INFO L87 Difference]: Start difference. First operand 3552 states and 8237 transitions. Second operand 4 states. [2019-10-22 11:27:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:49,506 INFO L93 Difference]: Finished difference Result 3552 states and 8205 transitions. [2019-10-22 11:27:49,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:49,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 11:27:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:49,510 INFO L225 Difference]: With dead ends: 3552 [2019-10-22 11:27:49,511 INFO L226 Difference]: Without dead ends: 3552 [2019-10-22 11:27:49,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2019-10-22 11:27:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3074. [2019-10-22 11:27:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2019-10-22 11:27:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 7105 transitions. [2019-10-22 11:27:49,554 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 7105 transitions. Word has length 84 [2019-10-22 11:27:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:49,555 INFO L462 AbstractCegarLoop]: Abstraction has 3074 states and 7105 transitions. [2019-10-22 11:27:49,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 7105 transitions. [2019-10-22 11:27:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:49,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:49,559 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:49,559 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -968363124, now seen corresponding path program 1 times [2019-10-22 11:27:49,559 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:49,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868368104] [2019-10-22 11:27:49,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:49,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:49,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:49,641 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:27:49,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868368104] [2019-10-22 11:27:49,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:49,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:49,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682918836] [2019-10-22 11:27:49,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:49,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:49,643 INFO L87 Difference]: Start difference. First operand 3074 states and 7105 transitions. Second operand 5 states. [2019-10-22 11:27:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:49,673 INFO L93 Difference]: Finished difference Result 3074 states and 7089 transitions. [2019-10-22 11:27:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:49,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-22 11:27:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:49,676 INFO L225 Difference]: With dead ends: 3074 [2019-10-22 11:27:49,676 INFO L226 Difference]: Without dead ends: 3074 [2019-10-22 11:27:49,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2019-10-22 11:27:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 3074. [2019-10-22 11:27:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2019-10-22 11:27:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 7089 transitions. [2019-10-22 11:27:49,703 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 7089 transitions. Word has length 84 [2019-10-22 11:27:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:49,703 INFO L462 AbstractCegarLoop]: Abstraction has 3074 states and 7089 transitions. [2019-10-22 11:27:49,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 7089 transitions. [2019-10-22 11:27:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:49,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:49,706 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:49,706 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash -80859443, now seen corresponding path program 1 times [2019-10-22 11:27:49,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:49,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648749124] [2019-10-22 11:27:49,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:49,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:49,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:49,865 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:27:49,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648749124] [2019-10-22 11:27:49,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:49,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:27:49,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797682547] [2019-10-22 11:27:49,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:27:49,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:49,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:27:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:27:49,866 INFO L87 Difference]: Start difference. First operand 3074 states and 7089 transitions. Second operand 9 states. [2019-10-22 11:27:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:50,238 INFO L93 Difference]: Finished difference Result 11113 states and 25955 transitions. [2019-10-22 11:27:50,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 11:27:50,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-10-22 11:27:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:50,244 INFO L225 Difference]: With dead ends: 11113 [2019-10-22 11:27:50,244 INFO L226 Difference]: Without dead ends: 7155 [2019-10-22 11:27:50,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:27:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7155 states. [2019-10-22 11:27:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7155 to 3186. [2019-10-22 11:27:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2019-10-22 11:27:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 7308 transitions. [2019-10-22 11:27:50,284 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 7308 transitions. Word has length 84 [2019-10-22 11:27:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:50,285 INFO L462 AbstractCegarLoop]: Abstraction has 3186 states and 7308 transitions. [2019-10-22 11:27:50,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:27:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 7308 transitions. [2019-10-22 11:27:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:50,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:50,287 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:50,287 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1546752712, now seen corresponding path program 1 times [2019-10-22 11:27:50,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:50,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610292946] [2019-10-22 11:27:50,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:50,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:50,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:50,384 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:27:50,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610292946] [2019-10-22 11:27:50,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:50,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:50,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122266092] [2019-10-22 11:27:50,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:50,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:50,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:50,386 INFO L87 Difference]: Start difference. First operand 3186 states and 7308 transitions. Second operand 6 states. [2019-10-22 11:27:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:50,582 INFO L93 Difference]: Finished difference Result 3551 states and 8091 transitions. [2019-10-22 11:27:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:27:50,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-22 11:27:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:50,585 INFO L225 Difference]: With dead ends: 3551 [2019-10-22 11:27:50,585 INFO L226 Difference]: Without dead ends: 3509 [2019-10-22 11:27:50,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2019-10-22 11:27:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3080. [2019-10-22 11:27:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-22 11:27:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 7018 transitions. [2019-10-22 11:27:50,613 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 7018 transitions. Word has length 84 [2019-10-22 11:27:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:50,613 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 7018 transitions. [2019-10-22 11:27:50,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 7018 transitions. [2019-10-22 11:27:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:50,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:50,616 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:50,616 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash -530456631, now seen corresponding path program 2 times [2019-10-22 11:27:50,616 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:50,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522937714] [2019-10-22 11:27:50,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:50,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:50,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:50,717 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:27:50,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522937714] [2019-10-22 11:27:50,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:50,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:27:50,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12413923] [2019-10-22 11:27:50,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:27:50,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:50,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:27:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:50,719 INFO L87 Difference]: Start difference. First operand 3080 states and 7018 transitions. Second operand 7 states. [2019-10-22 11:27:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:50,794 INFO L93 Difference]: Finished difference Result 5273 states and 12085 transitions. [2019-10-22 11:27:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:27:50,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 11:27:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:50,797 INFO L225 Difference]: With dead ends: 5273 [2019-10-22 11:27:50,797 INFO L226 Difference]: Without dead ends: 2297 [2019-10-22 11:27:50,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:27:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2019-10-22 11:27:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2297. [2019-10-22 11:27:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2019-10-22 11:27:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 5254 transitions. [2019-10-22 11:27:50,823 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 5254 transitions. Word has length 84 [2019-10-22 11:27:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:50,823 INFO L462 AbstractCegarLoop]: Abstraction has 2297 states and 5254 transitions. [2019-10-22 11:27:50,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:27:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 5254 transitions. [2019-10-22 11:27:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:50,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:50,826 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:50,826 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1786334217, now seen corresponding path program 3 times [2019-10-22 11:27:50,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:50,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655943338] [2019-10-22 11:27:50,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:50,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:50,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:50,969 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:27:50,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655943338] [2019-10-22 11:27:50,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:50,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:27:50,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184458747] [2019-10-22 11:27:50,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:27:50,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:50,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:27:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:27:50,971 INFO L87 Difference]: Start difference. First operand 2297 states and 5254 transitions. Second operand 10 states. [2019-10-22 11:27:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:51,317 INFO L93 Difference]: Finished difference Result 3789 states and 8696 transitions. [2019-10-22 11:27:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:27:51,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-22 11:27:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:51,319 INFO L225 Difference]: With dead ends: 3789 [2019-10-22 11:27:51,319 INFO L226 Difference]: Without dead ends: 2483 [2019-10-22 11:27:51,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:27:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-10-22 11:27:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2277. [2019-10-22 11:27:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-10-22 11:27:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 5212 transitions. [2019-10-22 11:27:51,339 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 5212 transitions. Word has length 84 [2019-10-22 11:27:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:51,339 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 5212 transitions. [2019-10-22 11:27:51,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:27:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 5212 transitions. [2019-10-22 11:27:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:51,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:51,342 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:51,343 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2108825047, now seen corresponding path program 4 times [2019-10-22 11:27:51,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:51,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968754355] [2019-10-22 11:27:51,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:51,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:51,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:51,418 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:27:51,418 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:51,559 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:27:51,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:51 BasicIcfg [2019-10-22 11:27:51,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:51,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:51,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:51,562 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:51,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:25" (3/4) ... [2019-10-22 11:27:51,564 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:27:51,721 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb4dbe0d-19ba-4a15-b4a3-36f685177fee/bin/utaipan/witness.graphml [2019-10-22 11:27:51,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:51,724 INFO L168 Benchmark]: Toolchain (without parser) took 27320.30 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 944.5 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 670.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:51,724 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:51,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:51,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:51,725 INFO L168 Benchmark]: Boogie Preprocessor took 48.65 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:27:51,729 INFO L168 Benchmark]: RCFGBuilder took 572.36 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:51,729 INFO L168 Benchmark]: TraceAbstraction took 25950.50 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-10-22 11:27:51,730 INFO L168 Benchmark]: Witness Printer took 160.29 ms. Allocated memory is still 4.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:51,731 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 539.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.65 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 572.36 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25950.50 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 160.29 ms. Allocated memory is still 4.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1641; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1642; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. Result: UNSAFE, OverallTime: 25.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6600 SDtfs, 7636 SDslu, 16646 SDs, 0 SdLazy, 4843 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 70715 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 353644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 incorrect! Received shutdown request...