./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ee110232f003539cc7f511cc683fd889d7ad081 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 14:42:37,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:42:37,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:42:37,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:42:37,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:42:37,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:42:37,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:42:37,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:42:37,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:42:37,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:42:37,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:42:37,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:42:37,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:42:37,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:42:37,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:42:37,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:42:37,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:42:37,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:42:37,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:42:37,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:42:37,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:42:37,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:42:37,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:42:37,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:42:37,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:42:37,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:42:37,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:42:37,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:42:37,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:42:37,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:42:37,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:42:37,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:42:37,141 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:42:37,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:42:37,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:42:37,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:42:37,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 14:42:37,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:42:37,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:42:37,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 14:42:37,152 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 14:42:37,152 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 14:42:37,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 14:42:37,153 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 14:42:37,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:42:37,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 14:42:37,154 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ee110232f003539cc7f511cc683fd889d7ad081 [2018-12-09 14:42:37,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:42:37,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:42:37,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:42:37,180 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:42:37,181 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:42:37,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_power.oepc_false-unreach-call.i [2018-12-09 14:42:37,215 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/data/dba3d824b/c486358d11fb443bace84f42be0110f3/FLAGd5bd241e4 [2018-12-09 14:42:37,681 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:42:37,681 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/sv-benchmarks/c/pthread-wmm/rfi004_power.oepc_false-unreach-call.i [2018-12-09 14:42:37,688 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/data/dba3d824b/c486358d11fb443bace84f42be0110f3/FLAGd5bd241e4 [2018-12-09 14:42:38,200 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/data/dba3d824b/c486358d11fb443bace84f42be0110f3 [2018-12-09 14:42:38,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:42:38,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 14:42:38,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:42:38,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:42:38,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:42:38,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e282df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38, skipping insertion in model container [2018-12-09 14:42:38,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:42:38,244 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:42:38,429 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:42:38,436 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:42:38,505 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:42:38,535 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:42:38,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38 WrapperNode [2018-12-09 14:42:38,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:42:38,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 14:42:38,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 14:42:38,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 14:42:38,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 14:42:38,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:42:38,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:42:38,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:42:38,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... [2018-12-09 14:42:38,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:42:38,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:42:38,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:42:38,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:42:38,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:42:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 14:42:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 14:42:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 14:42:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 14:42:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 14:42:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 14:42:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 14:42:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 14:42:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 14:42:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:42:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:42:38,620 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 14:42:38,918 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:42:38,918 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 14:42:38,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:38 BoogieIcfgContainer [2018-12-09 14:42:38,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:42:38,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:42:38,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:42:38,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:42:38,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:42:38" (1/3) ... [2018-12-09 14:42:38,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3348edcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:42:38, skipping insertion in model container [2018-12-09 14:42:38,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:38" (2/3) ... [2018-12-09 14:42:38,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3348edcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:42:38, skipping insertion in model container [2018-12-09 14:42:38,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:38" (3/3) ... [2018-12-09 14:42:38,923 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_power.oepc_false-unreach-call.i [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,951 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,966 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,966 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,966 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,967 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,967 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:42:38,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 14:42:38,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:42:38,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 14:42:38,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 14:42:39,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:42:39,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 14:42:39,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:42:39,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:42:39,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:42:39,017 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:42:39,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:42:39,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:42:39,024 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-09 14:42:40,254 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-09 14:42:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-09 14:42:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 14:42:40,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:40,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:40,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:40,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-09 14:42:40,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:40,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:40,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:40,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:40,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:40,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:40,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:42:40,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:42:40,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:42:40,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:42:40,452 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-09 14:42:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:40,812 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-09 14:42:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 14:42:40,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-09 14:42:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:40,944 INFO L225 Difference]: With dead ends: 47768 [2018-12-09 14:42:40,944 INFO L226 Difference]: Without dead ends: 34608 [2018-12-09 14:42:40,946 INFO L631 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 [2018-12-09 14:42:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-09 14:42:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-09 14:42:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-09 14:42:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-09 14:42:41,615 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-09 14:42:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:41,615 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-09 14:42:41,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:42:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-09 14:42:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 14:42:41,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:41,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:41,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:41,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-09 14:42:41,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:41,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:41,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:42:41,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:41,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:42:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:42:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:42:41,673 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2018-12-09 14:42:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:42,142 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2018-12-09 14:42:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:42:42,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 14:42:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:42,279 INFO L225 Difference]: With dead ends: 47634 [2018-12-09 14:42:42,279 INFO L226 Difference]: Without dead ends: 47066 [2018-12-09 14:42:42,279 INFO L631 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 [2018-12-09 14:42:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2018-12-09 14:42:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2018-12-09 14:42:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2018-12-09 14:42:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2018-12-09 14:42:43,013 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2018-12-09 14:42:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:43,014 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2018-12-09 14:42:43,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:42:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2018-12-09 14:42:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 14:42:43,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:43,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:43,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:43,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-12-09 14:42:43,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:43,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:43,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:43,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:43,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:42:43,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:43,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:42:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:42:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:42:43,099 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2018-12-09 14:42:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:43,445 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2018-12-09 14:42:43,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:42:43,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 14:42:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:43,575 INFO L225 Difference]: With dead ends: 63028 [2018-12-09 14:42:43,575 INFO L226 Difference]: Without dead ends: 62564 [2018-12-09 14:42:43,575 INFO L631 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 [2018-12-09 14:42:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2018-12-09 14:42:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2018-12-09 14:42:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-09 14:42:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2018-12-09 14:42:44,335 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2018-12-09 14:42:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:44,336 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2018-12-09 14:42:44,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:42:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2018-12-09 14:42:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 14:42:44,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:44,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:44,340 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:44,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-09 14:42:44,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:44,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:44,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:44,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:42:44,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:44,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:42:44,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:42:44,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:42:44,375 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2018-12-09 14:42:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:44,542 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2018-12-09 14:42:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:42:44,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 14:42:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:44,619 INFO L225 Difference]: With dead ends: 45910 [2018-12-09 14:42:44,619 INFO L226 Difference]: Without dead ends: 45910 [2018-12-09 14:42:44,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:42:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2018-12-09 14:42:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2018-12-09 14:42:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2018-12-09 14:42:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2018-12-09 14:42:45,302 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2018-12-09 14:42:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:45,302 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2018-12-09 14:42:45,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:42:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2018-12-09 14:42:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 14:42:45,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:45,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:45,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:45,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-09 14:42:45,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:45,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:45,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:45,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:45,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:45,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:45,375 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2018-12-09 14:42:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:45,827 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2018-12-09 14:42:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 14:42:45,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 14:42:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:45,948 INFO L225 Difference]: With dead ends: 70850 [2018-12-09 14:42:45,948 INFO L226 Difference]: Without dead ends: 70314 [2018-12-09 14:42:45,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 14:42:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2018-12-09 14:42:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2018-12-09 14:42:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2018-12-09 14:42:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2018-12-09 14:42:46,773 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2018-12-09 14:42:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:46,773 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2018-12-09 14:42:46,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2018-12-09 14:42:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 14:42:46,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:46,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:46,781 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:46,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2018-12-09 14:42:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:46,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:46,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:46,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:46,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:46,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:46,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:46,847 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2018-12-09 14:42:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:47,282 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2018-12-09 14:42:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:42:47,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 14:42:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:47,378 INFO L225 Difference]: With dead ends: 56599 [2018-12-09 14:42:47,378 INFO L226 Difference]: Without dead ends: 55460 [2018-12-09 14:42:47,379 INFO L631 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 [2018-12-09 14:42:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2018-12-09 14:42:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2018-12-09 14:42:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2018-12-09 14:42:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2018-12-09 14:42:48,332 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2018-12-09 14:42:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:48,332 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2018-12-09 14:42:48,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2018-12-09 14:42:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 14:42:48,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:48,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:48,342 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:48,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2018-12-09 14:42:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:48,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:48,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:42:48,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:48,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:42:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:42:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:42:48,397 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2018-12-09 14:42:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:49,022 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2018-12-09 14:42:49,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 14:42:49,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-09 14:42:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:49,146 INFO L225 Difference]: With dead ends: 75638 [2018-12-09 14:42:49,146 INFO L226 Difference]: Without dead ends: 75638 [2018-12-09 14:42:49,146 INFO L631 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 [2018-12-09 14:42:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2018-12-09 14:42:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2018-12-09 14:42:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2018-12-09 14:42:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2018-12-09 14:42:50,302 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2018-12-09 14:42:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:50,303 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2018-12-09 14:42:50,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:42:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2018-12-09 14:42:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 14:42:50,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:50,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:50,313 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:50,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2018-12-09 14:42:50,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:50,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:50,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:50,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:50,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:42:50,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:50,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:42:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:42:50,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:42:50,352 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 3 states. [2018-12-09 14:42:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:50,508 INFO L93 Difference]: Finished difference Result 46767 states and 162434 transitions. [2018-12-09 14:42:50,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:42:50,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 14:42:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:50,591 INFO L225 Difference]: With dead ends: 46767 [2018-12-09 14:42:50,591 INFO L226 Difference]: Without dead ends: 46187 [2018-12-09 14:42:50,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:42:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46187 states. [2018-12-09 14:42:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46187 to 44422. [2018-12-09 14:42:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44422 states. [2018-12-09 14:42:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44422 states to 44422 states and 155155 transitions. [2018-12-09 14:42:51,232 INFO L78 Accepts]: Start accepts. Automaton has 44422 states and 155155 transitions. Word has length 54 [2018-12-09 14:42:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:51,233 INFO L480 AbstractCegarLoop]: Abstraction has 44422 states and 155155 transitions. [2018-12-09 14:42:51,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:42:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 44422 states and 155155 transitions. [2018-12-09 14:42:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 14:42:51,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:51,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:51,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:51,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1915106411, now seen corresponding path program 1 times [2018-12-09 14:42:51,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:51,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:51,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:51,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:51,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:51,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:51,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:51,302 INFO L87 Difference]: Start difference. First operand 44422 states and 155155 transitions. Second operand 6 states. [2018-12-09 14:42:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:51,717 INFO L93 Difference]: Finished difference Result 58724 states and 198370 transitions. [2018-12-09 14:42:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:42:51,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-09 14:42:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:51,809 INFO L225 Difference]: With dead ends: 58724 [2018-12-09 14:42:51,809 INFO L226 Difference]: Without dead ends: 58724 [2018-12-09 14:42:51,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:42:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58724 states. [2018-12-09 14:42:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58724 to 48778. [2018-12-09 14:42:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48778 states. [2018-12-09 14:42:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48778 states to 48778 states and 167871 transitions. [2018-12-09 14:42:52,549 INFO L78 Accepts]: Start accepts. Automaton has 48778 states and 167871 transitions. Word has length 55 [2018-12-09 14:42:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:52,549 INFO L480 AbstractCegarLoop]: Abstraction has 48778 states and 167871 transitions. [2018-12-09 14:42:52,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 48778 states and 167871 transitions. [2018-12-09 14:42:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 14:42:52,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:52,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:52,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:52,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:52,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1027602730, now seen corresponding path program 1 times [2018-12-09 14:42:52,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:52,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:52,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:52,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:52,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:52,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:52,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:42:52,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:42:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:42:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:42:52,588 INFO L87 Difference]: Start difference. First operand 48778 states and 167871 transitions. Second operand 4 states. [2018-12-09 14:42:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:52,627 INFO L93 Difference]: Finished difference Result 10152 states and 31522 transitions. [2018-12-09 14:42:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:42:52,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 14:42:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:52,636 INFO L225 Difference]: With dead ends: 10152 [2018-12-09 14:42:52,636 INFO L226 Difference]: Without dead ends: 8646 [2018-12-09 14:42:52,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:42:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-12-09 14:42:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8598. [2018-12-09 14:42:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8598 states. [2018-12-09 14:42:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 26467 transitions. [2018-12-09 14:42:52,802 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 26467 transitions. Word has length 55 [2018-12-09 14:42:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:52,802 INFO L480 AbstractCegarLoop]: Abstraction has 8598 states and 26467 transitions. [2018-12-09 14:42:52,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:42:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 26467 transitions. [2018-12-09 14:42:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 14:42:52,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:52,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:52,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:52,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-12-09 14:42:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:52,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:52,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:52,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:42:52,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:52,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:42:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:42:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:42:52,829 INFO L87 Difference]: Start difference. First operand 8598 states and 26467 transitions. Second operand 4 states. [2018-12-09 14:42:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:52,914 INFO L93 Difference]: Finished difference Result 10217 states and 31174 transitions. [2018-12-09 14:42:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:42:52,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 14:42:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:52,924 INFO L225 Difference]: With dead ends: 10217 [2018-12-09 14:42:52,924 INFO L226 Difference]: Without dead ends: 10217 [2018-12-09 14:42:52,924 INFO L631 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 [2018-12-09 14:42:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2018-12-09 14:42:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 9249. [2018-12-09 14:42:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9249 states. [2018-12-09 14:42:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9249 states to 9249 states and 28328 transitions. [2018-12-09 14:42:53,017 INFO L78 Accepts]: Start accepts. Automaton has 9249 states and 28328 transitions. Word has length 64 [2018-12-09 14:42:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:53,018 INFO L480 AbstractCegarLoop]: Abstraction has 9249 states and 28328 transitions. [2018-12-09 14:42:53,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:42:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9249 states and 28328 transitions. [2018-12-09 14:42:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 14:42:53,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:53,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:53,021 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:53,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-12-09 14:42:53,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:53,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:53,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:53,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:53,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:53,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:53,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:53,072 INFO L87 Difference]: Start difference. First operand 9249 states and 28328 transitions. Second operand 6 states. [2018-12-09 14:42:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:53,262 INFO L93 Difference]: Finished difference Result 16143 states and 49321 transitions. [2018-12-09 14:42:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 14:42:53,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 14:42:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:53,279 INFO L225 Difference]: With dead ends: 16143 [2018-12-09 14:42:53,279 INFO L226 Difference]: Without dead ends: 16079 [2018-12-09 14:42:53,280 INFO L631 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 [2018-12-09 14:42:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16079 states. [2018-12-09 14:42:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16079 to 10330. [2018-12-09 14:42:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10330 states. [2018-12-09 14:42:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10330 states to 10330 states and 31497 transitions. [2018-12-09 14:42:53,406 INFO L78 Accepts]: Start accepts. Automaton has 10330 states and 31497 transitions. Word has length 64 [2018-12-09 14:42:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:53,406 INFO L480 AbstractCegarLoop]: Abstraction has 10330 states and 31497 transitions. [2018-12-09 14:42:53,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10330 states and 31497 transitions. [2018-12-09 14:42:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:53,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:53,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:53,412 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:53,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash 990890537, now seen corresponding path program 1 times [2018-12-09 14:42:53,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:53,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:53,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:53,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:53,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:53,463 INFO L87 Difference]: Start difference. First operand 10330 states and 31497 transitions. Second operand 6 states. [2018-12-09 14:42:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:53,830 INFO L93 Difference]: Finished difference Result 13727 states and 40916 transitions. [2018-12-09 14:42:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:42:53,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 14:42:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:53,844 INFO L225 Difference]: With dead ends: 13727 [2018-12-09 14:42:53,844 INFO L226 Difference]: Without dead ends: 13727 [2018-12-09 14:42:53,844 INFO L631 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 [2018-12-09 14:42:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13727 states. [2018-12-09 14:42:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13727 to 13018. [2018-12-09 14:42:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13018 states. [2018-12-09 14:42:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13018 states to 13018 states and 39085 transitions. [2018-12-09 14:42:53,979 INFO L78 Accepts]: Start accepts. Automaton has 13018 states and 39085 transitions. Word has length 68 [2018-12-09 14:42:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:53,979 INFO L480 AbstractCegarLoop]: Abstraction has 13018 states and 39085 transitions. [2018-12-09 14:42:53,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 13018 states and 39085 transitions. [2018-12-09 14:42:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:53,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:53,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:53,987 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:53,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash -253873944, now seen corresponding path program 1 times [2018-12-09 14:42:53,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:53,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:53,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:53,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:42:54,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:54,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:42:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:42:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:42:54,024 INFO L87 Difference]: Start difference. First operand 13018 states and 39085 transitions. Second operand 4 states. [2018-12-09 14:42:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:54,158 INFO L93 Difference]: Finished difference Result 16578 states and 49219 transitions. [2018-12-09 14:42:54,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 14:42:54,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 14:42:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:54,176 INFO L225 Difference]: With dead ends: 16578 [2018-12-09 14:42:54,176 INFO L226 Difference]: Without dead ends: 16578 [2018-12-09 14:42:54,176 INFO L631 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 [2018-12-09 14:42:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2018-12-09 14:42:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 14153. [2018-12-09 14:42:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2018-12-09 14:42:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42248 transitions. [2018-12-09 14:42:54,326 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42248 transitions. Word has length 68 [2018-12-09 14:42:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:54,327 INFO L480 AbstractCegarLoop]: Abstraction has 14153 states and 42248 transitions. [2018-12-09 14:42:54,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:42:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42248 transitions. [2018-12-09 14:42:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:54,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:54,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:54,334 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:54,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1086318806, now seen corresponding path program 1 times [2018-12-09 14:42:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:54,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:54,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:54,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:54,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:54,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:54,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:54,402 INFO L87 Difference]: Start difference. First operand 14153 states and 42248 transitions. Second operand 6 states. [2018-12-09 14:42:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:54,607 INFO L93 Difference]: Finished difference Result 16779 states and 48544 transitions. [2018-12-09 14:42:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 14:42:54,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 14:42:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:54,623 INFO L225 Difference]: With dead ends: 16779 [2018-12-09 14:42:54,623 INFO L226 Difference]: Without dead ends: 16779 [2018-12-09 14:42:54,623 INFO L631 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 [2018-12-09 14:42:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16779 states. [2018-12-09 14:42:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16779 to 14089. [2018-12-09 14:42:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14089 states. [2018-12-09 14:42:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 41311 transitions. [2018-12-09 14:42:54,773 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 41311 transitions. Word has length 68 [2018-12-09 14:42:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:54,774 INFO L480 AbstractCegarLoop]: Abstraction has 14089 states and 41311 transitions. [2018-12-09 14:42:54,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 41311 transitions. [2018-12-09 14:42:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:54,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:54,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:54,781 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:54,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -874967893, now seen corresponding path program 1 times [2018-12-09 14:42:54,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:54,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:54,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:54,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:54,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:42:54,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:54,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:42:54,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:42:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:42:54,848 INFO L87 Difference]: Start difference. First operand 14089 states and 41311 transitions. Second operand 5 states. [2018-12-09 14:42:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:55,015 INFO L93 Difference]: Finished difference Result 17352 states and 50546 transitions. [2018-12-09 14:42:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:42:55,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 14:42:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:55,031 INFO L225 Difference]: With dead ends: 17352 [2018-12-09 14:42:55,032 INFO L226 Difference]: Without dead ends: 17352 [2018-12-09 14:42:55,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:42:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17352 states. [2018-12-09 14:42:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17352 to 15080. [2018-12-09 14:42:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15080 states. [2018-12-09 14:42:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 43876 transitions. [2018-12-09 14:42:55,183 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 43876 transitions. Word has length 68 [2018-12-09 14:42:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:55,183 INFO L480 AbstractCegarLoop]: Abstraction has 15080 states and 43876 transitions. [2018-12-09 14:42:55,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:42:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 43876 transitions. [2018-12-09 14:42:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:55,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:55,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:55,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:55,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-12-09 14:42:55,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:55,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:55,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:55,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:55,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:55,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:55,230 INFO L87 Difference]: Start difference. First operand 15080 states and 43876 transitions. Second operand 6 states. [2018-12-09 14:42:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:55,605 INFO L93 Difference]: Finished difference Result 23712 states and 68586 transitions. [2018-12-09 14:42:55,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:42:55,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 14:42:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:55,627 INFO L225 Difference]: With dead ends: 23712 [2018-12-09 14:42:55,627 INFO L226 Difference]: Without dead ends: 23712 [2018-12-09 14:42:55,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:42:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2018-12-09 14:42:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 19436. [2018-12-09 14:42:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19436 states. [2018-12-09 14:42:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 56779 transitions. [2018-12-09 14:42:55,870 INFO L78 Accepts]: Start accepts. Automaton has 19436 states and 56779 transitions. Word has length 68 [2018-12-09 14:42:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:55,870 INFO L480 AbstractCegarLoop]: Abstraction has 19436 states and 56779 transitions. [2018-12-09 14:42:55,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 19436 states and 56779 transitions. [2018-12-09 14:42:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:55,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:55,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:55,879 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:55,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-12-09 14:42:55,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:55,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:55,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:42:55,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:55,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:42:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:42:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:42:55,909 INFO L87 Difference]: Start difference. First operand 19436 states and 56779 transitions. Second operand 4 states. [2018-12-09 14:42:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:56,144 INFO L93 Difference]: Finished difference Result 20064 states and 58266 transitions. [2018-12-09 14:42:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:42:56,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 14:42:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:56,163 INFO L225 Difference]: With dead ends: 20064 [2018-12-09 14:42:56,163 INFO L226 Difference]: Without dead ends: 19360 [2018-12-09 14:42:56,163 INFO L631 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 [2018-12-09 14:42:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19360 states. [2018-12-09 14:42:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19360 to 18392. [2018-12-09 14:42:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2018-12-09 14:42:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 53455 transitions. [2018-12-09 14:42:56,353 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 53455 transitions. Word has length 68 [2018-12-09 14:42:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:56,354 INFO L480 AbstractCegarLoop]: Abstraction has 18392 states and 53455 transitions. [2018-12-09 14:42:56,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:42:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 53455 transitions. [2018-12-09 14:42:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:56,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:56,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:56,362 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:56,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:56,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-12-09 14:42:56,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:56,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:56,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:56,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:56,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:56,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 14:42:56,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 14:42:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 14:42:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 14:42:56,450 INFO L87 Difference]: Start difference. First operand 18392 states and 53455 transitions. Second operand 9 states. [2018-12-09 14:42:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:56,805 INFO L93 Difference]: Finished difference Result 26124 states and 75518 transitions. [2018-12-09 14:42:56,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 14:42:56,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-09 14:42:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:56,833 INFO L225 Difference]: With dead ends: 26124 [2018-12-09 14:42:56,833 INFO L226 Difference]: Without dead ends: 26124 [2018-12-09 14:42:56,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 14:42:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26124 states. [2018-12-09 14:42:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26124 to 21225. [2018-12-09 14:42:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21225 states. [2018-12-09 14:42:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21225 states to 21225 states and 61505 transitions. [2018-12-09 14:42:57,058 INFO L78 Accepts]: Start accepts. Automaton has 21225 states and 61505 transitions. Word has length 68 [2018-12-09 14:42:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:57,058 INFO L480 AbstractCegarLoop]: Abstraction has 21225 states and 61505 transitions. [2018-12-09 14:42:57,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 14:42:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21225 states and 61505 transitions. [2018-12-09 14:42:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 14:42:57,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:57,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:57,068 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:57,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-12-09 14:42:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:57,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:57,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:42:57,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:57,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:42:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:42:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:42:57,105 INFO L87 Difference]: Start difference. First operand 21225 states and 61505 transitions. Second operand 5 states. [2018-12-09 14:42:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:57,130 INFO L93 Difference]: Finished difference Result 5849 states and 14057 transitions. [2018-12-09 14:42:57,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 14:42:57,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 14:42:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:57,134 INFO L225 Difference]: With dead ends: 5849 [2018-12-09 14:42:57,134 INFO L226 Difference]: Without dead ends: 4653 [2018-12-09 14:42:57,134 INFO L631 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 [2018-12-09 14:42:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2018-12-09 14:42:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 3961. [2018-12-09 14:42:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2018-12-09 14:42:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 9298 transitions. [2018-12-09 14:42:57,165 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 9298 transitions. Word has length 68 [2018-12-09 14:42:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:57,165 INFO L480 AbstractCegarLoop]: Abstraction has 3961 states and 9298 transitions. [2018-12-09 14:42:57,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:42:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 9298 transitions. [2018-12-09 14:42:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:57,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:57,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:57,168 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:57,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -901530196, now seen corresponding path program 1 times [2018-12-09 14:42:57,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:57,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:57,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:57,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:57,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:42:57,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:57,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:42:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:42:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:42:57,208 INFO L87 Difference]: Start difference. First operand 3961 states and 9298 transitions. Second operand 4 states. [2018-12-09 14:42:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:57,229 INFO L93 Difference]: Finished difference Result 3881 states and 9066 transitions. [2018-12-09 14:42:57,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:42:57,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-09 14:42:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:57,232 INFO L225 Difference]: With dead ends: 3881 [2018-12-09 14:42:57,232 INFO L226 Difference]: Without dead ends: 3881 [2018-12-09 14:42:57,232 INFO L631 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 [2018-12-09 14:42:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2018-12-09 14:42:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3384. [2018-12-09 14:42:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-12-09 14:42:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 7916 transitions. [2018-12-09 14:42:57,255 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 7916 transitions. Word has length 85 [2018-12-09 14:42:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:57,255 INFO L480 AbstractCegarLoop]: Abstraction has 3384 states and 7916 transitions. [2018-12-09 14:42:57,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:42:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 7916 transitions. [2018-12-09 14:42:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:57,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:57,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:57,258 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:57,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-12-09 14:42:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:57,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:57,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:42:57,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:57,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:42:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:42:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:42:57,316 INFO L87 Difference]: Start difference. First operand 3384 states and 7916 transitions. Second operand 5 states. [2018-12-09 14:42:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:57,338 INFO L93 Difference]: Finished difference Result 3384 states and 7900 transitions. [2018-12-09 14:42:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:42:57,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-09 14:42:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:57,341 INFO L225 Difference]: With dead ends: 3384 [2018-12-09 14:42:57,341 INFO L226 Difference]: Without dead ends: 3384 [2018-12-09 14:42:57,341 INFO L631 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 [2018-12-09 14:42:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2018-12-09 14:42:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2958. [2018-12-09 14:42:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2018-12-09 14:42:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 6888 transitions. [2018-12-09 14:42:57,363 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 6888 transitions. Word has length 85 [2018-12-09 14:42:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:57,363 INFO L480 AbstractCegarLoop]: Abstraction has 2958 states and 6888 transitions. [2018-12-09 14:42:57,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:42:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 6888 transitions. [2018-12-09 14:42:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:57,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:57,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:57,365 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:57,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-12-09 14:42:57,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:57,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 14:42:57,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:57,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 14:42:57,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 14:42:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 14:42:57,453 INFO L87 Difference]: Start difference. First operand 2958 states and 6888 transitions. Second operand 10 states. [2018-12-09 14:42:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:58,152 INFO L93 Difference]: Finished difference Result 5014 states and 11654 transitions. [2018-12-09 14:42:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 14:42:58,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-09 14:42:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:58,155 INFO L225 Difference]: With dead ends: 5014 [2018-12-09 14:42:58,155 INFO L226 Difference]: Without dead ends: 3506 [2018-12-09 14:42:58,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-09 14:42:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2018-12-09 14:42:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3031. [2018-12-09 14:42:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2018-12-09 14:42:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 6990 transitions. [2018-12-09 14:42:58,176 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 6990 transitions. Word has length 85 [2018-12-09 14:42:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:58,176 INFO L480 AbstractCegarLoop]: Abstraction has 3031 states and 6990 transitions. [2018-12-09 14:42:58,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 14:42:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 6990 transitions. [2018-12-09 14:42:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:58,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:58,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:58,179 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:58,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -749097736, now seen corresponding path program 1 times [2018-12-09 14:42:58,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:58,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:58,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:58,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:58,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:42:58,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:58,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:42:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:42:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:42:58,250 INFO L87 Difference]: Start difference. First operand 3031 states and 6990 transitions. Second operand 6 states. [2018-12-09 14:42:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:58,386 INFO L93 Difference]: Finished difference Result 3507 states and 7993 transitions. [2018-12-09 14:42:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:42:58,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-09 14:42:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:58,389 INFO L225 Difference]: With dead ends: 3507 [2018-12-09 14:42:58,389 INFO L226 Difference]: Without dead ends: 3453 [2018-12-09 14:42:58,389 INFO L631 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 [2018-12-09 14:42:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2018-12-09 14:42:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3048. [2018-12-09 14:42:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2018-12-09 14:42:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 6969 transitions. [2018-12-09 14:42:58,412 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 6969 transitions. Word has length 85 [2018-12-09 14:42:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:58,412 INFO L480 AbstractCegarLoop]: Abstraction has 3048 states and 6969 transitions. [2018-12-09 14:42:58,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:42:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 6969 transitions. [2018-12-09 14:42:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:58,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:58,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:58,415 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:58,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1468660217, now seen corresponding path program 2 times [2018-12-09 14:42:58,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:42:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:58,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:58,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 14:42:58,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:58,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 14:42:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 14:42:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 14:42:58,481 INFO L87 Difference]: Start difference. First operand 3048 states and 6969 transitions. Second operand 10 states. [2018-12-09 14:42:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:58,879 INFO L93 Difference]: Finished difference Result 5878 states and 13478 transitions. [2018-12-09 14:42:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 14:42:58,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-09 14:42:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:58,881 INFO L225 Difference]: With dead ends: 5878 [2018-12-09 14:42:58,881 INFO L226 Difference]: Without dead ends: 2287 [2018-12-09 14:42:58,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-09 14:42:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2018-12-09 14:42:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2287. [2018-12-09 14:42:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-12-09 14:42:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 5233 transitions. [2018-12-09 14:42:58,898 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 5233 transitions. Word has length 85 [2018-12-09 14:42:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:58,898 INFO L480 AbstractCegarLoop]: Abstraction has 2287 states and 5233 transitions. [2018-12-09 14:42:58,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 14:42:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 5233 transitions. [2018-12-09 14:42:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:58,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:58,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:58,899 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:58,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-12-09 14:42:58,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:58,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:58,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 14:42:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:58,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:42:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:42:58,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:42:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 14:42:58,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:42:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 14:42:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 14:42:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 14:42:58,983 INFO L87 Difference]: Start difference. First operand 2287 states and 5233 transitions. Second operand 11 states. [2018-12-09 14:42:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:42:59,457 INFO L93 Difference]: Finished difference Result 3776 states and 8669 transitions. [2018-12-09 14:42:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 14:42:59,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-09 14:42:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:42:59,458 INFO L225 Difference]: With dead ends: 3776 [2018-12-09 14:42:59,458 INFO L226 Difference]: Without dead ends: 2473 [2018-12-09 14:42:59,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 14:42:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2018-12-09 14:42:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2267. [2018-12-09 14:42:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2018-12-09 14:42:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 5191 transitions. [2018-12-09 14:42:59,472 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 5191 transitions. Word has length 85 [2018-12-09 14:42:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:42:59,473 INFO L480 AbstractCegarLoop]: Abstraction has 2267 states and 5191 transitions. [2018-12-09 14:42:59,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 14:42:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 5191 transitions. [2018-12-09 14:42:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 14:42:59,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:42:59,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:42:59,474 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:42:59,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:42:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-12-09 14:42:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:42:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:59,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 14:42:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:42:59,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:42:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:42:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:42:59,515 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 14:42:59,585 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 14:42:59,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:42:59 BasicIcfg [2018-12-09 14:42:59,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:42:59,586 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:42:59,586 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:42:59,586 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:42:59,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:38" (3/4) ... [2018-12-09 14:42:59,588 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 14:42:59,651 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d169867-c09f-4d70-b064-27d3fbe4a893/bin-2019/utaipan/witness.graphml [2018-12-09 14:42:59,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:42:59,651 INFO L168 Benchmark]: Toolchain (without parser) took 21448.49 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 948.1 MB in the beginning and 1.5 GB in the end (delta: -558.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-09 14:42:59,652 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:42:59,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 14:42:59,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 14:42:59,653 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:42:59,653 INFO L168 Benchmark]: RCFGBuilder took 332.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 14:42:59,653 INFO L168 Benchmark]: TraceAbstraction took 20667.19 ms. Allocated memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -468.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-09 14:42:59,654 INFO L168 Benchmark]: Witness Printer took 64.85 ms. Allocated memory is still 3.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:42:59,655 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 332.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20667.19 ms. Allocated memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -468.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 64.85 ms. Allocated memory is still 3.7 GB. Free memory is still 1.5 GB. There was no memory consumed. 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _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] [L682] -1 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] [L684] -1 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, y=0] [L685] -1 _Bool y$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, y=0, y$flush_delayed=0] [L686] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1651; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1651, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1652; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1652, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 20.5s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6872 SDtfs, 9215 SDslu, 16522 SDs, 0 SdLazy, 7322 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 147487 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1777 NumberOfCodeBlocks, 1777 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 315503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...