./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_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_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/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 3bccc60f19dbcc18d87154d20be228295e714a4b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:35:08,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:35:08,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:35:08,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:35:08,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:35:08,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:35:08,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:35:08,945 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:35:08,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:35:08,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:35:08,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:35:08,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:35:08,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:35:08,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:35:08,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:35:08,949 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:35:08,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:35:08,950 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:35:08,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:35:08,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:35:08,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:35:08,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:35:08,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:35:08,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:35:08,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:35:08,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:35:08,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:35:08,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:35:08,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:35:08,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:35:08,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:35:08,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:35:08,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:35:08,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:35:08,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:35:08,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:35:08,959 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:35:08,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:35:08,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:35:08,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:35:08,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:35:08,967 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:35:08,968 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:35:08,968 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:35:08,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:35:08,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:35:08,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:35:08,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:35:08,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:35:08,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:35:08,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:35:08,970 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:35:08,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:35:08,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:35:08,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:35:08,971 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_e29f976a-a7c1-453a-b8e6-d095c7561c24/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 -> 3bccc60f19dbcc18d87154d20be228295e714a4b [2018-12-09 10:35:08,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:35:08,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:35:09,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:35:09,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:35:09,003 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:35:09,003 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i [2018-12-09 10:35:09,043 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/data/ee386157b/47f80ad7e928462d915546341b363804/FLAGb4aa47f63 [2018-12-09 10:35:09,485 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:35:09,486 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i [2018-12-09 10:35:09,496 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/data/ee386157b/47f80ad7e928462d915546341b363804/FLAGb4aa47f63 [2018-12-09 10:35:09,507 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/data/ee386157b/47f80ad7e928462d915546341b363804 [2018-12-09 10:35:09,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:35:09,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:35:09,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:35:09,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:35:09,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:35:09,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09, skipping insertion in model container [2018-12-09 10:35:09,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:35:09,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:35:09,751 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:35:09,761 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:35:09,831 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:35:09,861 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:35:09,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09 WrapperNode [2018-12-09 10:35:09,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:35:09,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:35:09,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:35:09,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:35:09,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:35:09,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:35:09,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:35:09,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:35:09,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... [2018-12-09 10:35:09,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:35:09,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:35:09,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:35:09,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:35:09,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/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 10:35:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:35:09,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:35:09,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 10:35:09,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:35:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:35:09,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:35:09,945 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 10:35:10,259 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:35:10,259 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:35:10,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:35:10 BoogieIcfgContainer [2018-12-09 10:35:10,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:35:10,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:35:10,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:35:10,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:35:10,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:35:09" (1/3) ... [2018-12-09 10:35:10,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d163916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:35:10, skipping insertion in model container [2018-12-09 10:35:10,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:35:09" (2/3) ... [2018-12-09 10:35:10,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d163916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:35:10, skipping insertion in model container [2018-12-09 10:35:10,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:35:10" (3/3) ... [2018-12-09 10:35:10,264 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032_rmo.opt_false-unreach-call.i [2018-12-09 10:35:10,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,286 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,286 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,287 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,290 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,291 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,292 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:35:10,307 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:35:10,307 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:35:10,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:35:10,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:35:10,337 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:35:10,337 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:35:10,337 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:35:10,337 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:35:10,338 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:35:10,338 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:35:10,338 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:35:10,338 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:35:10,344 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149places, 180 transitions [2018-12-09 10:35:29,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149048 states. [2018-12-09 10:35:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 149048 states. [2018-12-09 10:35:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 10:35:29,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:35:29,068 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] [2018-12-09 10:35:29,070 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:35:29,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:35:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1796074028, now seen corresponding path program 1 times [2018-12-09 10:35:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:35:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:35:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:29,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:35:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:35:29,227 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 10:35:29,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:35:29,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:35:29,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:35:29,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:35:29,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:35:29,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:35:29,243 INFO L87 Difference]: Start difference. First operand 149048 states. Second operand 4 states. [2018-12-09 10:35:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:35:30,741 INFO L93 Difference]: Finished difference Result 257068 states and 1188607 transitions. [2018-12-09 10:35:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:35:30,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 10:35:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:35:33,071 INFO L225 Difference]: With dead ends: 257068 [2018-12-09 10:35:33,071 INFO L226 Difference]: Without dead ends: 174818 [2018-12-09 10:35:33,072 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 10:35:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174818 states. [2018-12-09 10:35:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174818 to 110558. [2018-12-09 10:35:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-12-09 10:35:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511489 transitions. [2018-12-09 10:35:36,147 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511489 transitions. Word has length 49 [2018-12-09 10:35:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:35:36,148 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511489 transitions. [2018-12-09 10:35:36,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:35:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511489 transitions. [2018-12-09 10:35:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 10:35:36,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:35:36,157 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] [2018-12-09 10:35:36,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:35:36,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:35:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash -506965212, now seen corresponding path program 1 times [2018-12-09 10:35:36,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:35:36,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:36,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:35:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:36,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:35:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:35:36,196 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 10:35:36,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:35:36,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:35:36,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:35:36,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:35:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:35:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:35:36,198 INFO L87 Difference]: Start difference. First operand 110558 states and 511489 transitions. Second operand 3 states. [2018-12-09 10:35:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:35:36,759 INFO L93 Difference]: Finished difference Result 110558 states and 511384 transitions. [2018-12-09 10:35:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:35:36,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-09 10:35:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:35:37,049 INFO L225 Difference]: With dead ends: 110558 [2018-12-09 10:35:37,049 INFO L226 Difference]: Without dead ends: 110558 [2018-12-09 10:35:37,049 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 10:35:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110558 states. [2018-12-09 10:35:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110558 to 110558. [2018-12-09 10:35:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-12-09 10:35:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511384 transitions. [2018-12-09 10:35:39,574 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511384 transitions. Word has length 57 [2018-12-09 10:35:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:35:39,574 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511384 transitions. [2018-12-09 10:35:39,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:35:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511384 transitions. [2018-12-09 10:35:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 10:35:39,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:35:39,581 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] [2018-12-09 10:35:39,581 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:35:39,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:35:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1235845123, now seen corresponding path program 1 times [2018-12-09 10:35:39,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:35:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:39,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:35:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:39,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:35:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:35:39,633 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 10:35:39,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:35:39,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:35:39,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:35:39,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:35:39,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:35:39,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:35:39,634 INFO L87 Difference]: Start difference. First operand 110558 states and 511384 transitions. Second operand 5 states. [2018-12-09 10:35:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:35:42,707 INFO L93 Difference]: Finished difference Result 240608 states and 1068639 transitions. [2018-12-09 10:35:42,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:35:42,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 10:35:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:35:43,347 INFO L225 Difference]: With dead ends: 240608 [2018-12-09 10:35:43,347 INFO L226 Difference]: Without dead ends: 237058 [2018-12-09 10:35:43,347 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 10:35:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237058 states. [2018-12-09 10:35:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237058 to 160438. [2018-12-09 10:35:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160438 states. [2018-12-09 10:35:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160438 states to 160438 states and 716828 transitions. [2018-12-09 10:35:47,012 INFO L78 Accepts]: Start accepts. Automaton has 160438 states and 716828 transitions. Word has length 57 [2018-12-09 10:35:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:35:47,012 INFO L480 AbstractCegarLoop]: Abstraction has 160438 states and 716828 transitions. [2018-12-09 10:35:47,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:35:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 160438 states and 716828 transitions. [2018-12-09 10:35:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:35:47,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:35:47,020 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] [2018-12-09 10:35:47,020 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:35:47,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:35:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1838099179, now seen corresponding path program 1 times [2018-12-09 10:35:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:35:47,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:47,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:35:47,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:47,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:35:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:35:47,076 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 10:35:47,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:35:47,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:35:47,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:35:47,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:35:47,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:35:47,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:35:47,077 INFO L87 Difference]: Start difference. First operand 160438 states and 716828 transitions. Second operand 6 states. [2018-12-09 10:35:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:35:48,711 INFO L93 Difference]: Finished difference Result 210258 states and 922769 transitions. [2018-12-09 10:35:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:35:48,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 10:35:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:35:49,249 INFO L225 Difference]: With dead ends: 210258 [2018-12-09 10:35:49,249 INFO L226 Difference]: Without dead ends: 207358 [2018-12-09 10:35:49,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:35:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207358 states. [2018-12-09 10:35:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207358 to 178278. [2018-12-09 10:35:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178278 states. [2018-12-09 10:35:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178278 states to 178278 states and 791365 transitions. [2018-12-09 10:35:56,583 INFO L78 Accepts]: Start accepts. Automaton has 178278 states and 791365 transitions. Word has length 58 [2018-12-09 10:35:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:35:56,583 INFO L480 AbstractCegarLoop]: Abstraction has 178278 states and 791365 transitions. [2018-12-09 10:35:56,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:35:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 178278 states and 791365 transitions. [2018-12-09 10:35:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 10:35:56,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:35:56,596 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] [2018-12-09 10:35:56,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:35:56,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:35:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash -299178373, now seen corresponding path program 1 times [2018-12-09 10:35:56,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:35:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:56,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:35:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:35:56,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:35:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:35:56,628 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 10:35:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:35:56,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:35:56,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:35:56,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:35:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:35:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:35:56,630 INFO L87 Difference]: Start difference. First operand 178278 states and 791365 transitions. Second operand 3 states. [2018-12-09 10:35:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:35:57,751 INFO L93 Difference]: Finished difference Result 231658 states and 1011134 transitions. [2018-12-09 10:35:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:35:57,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 10:35:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:35:58,362 INFO L225 Difference]: With dead ends: 231658 [2018-12-09 10:35:58,362 INFO L226 Difference]: Without dead ends: 231658 [2018-12-09 10:35:58,363 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 10:35:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231658 states. [2018-12-09 10:36:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231658 to 202943. [2018-12-09 10:36:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202943 states. [2018-12-09 10:36:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202943 states to 202943 states and 893422 transitions. [2018-12-09 10:36:03,030 INFO L78 Accepts]: Start accepts. Automaton has 202943 states and 893422 transitions. Word has length 60 [2018-12-09 10:36:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:03,031 INFO L480 AbstractCegarLoop]: Abstraction has 202943 states and 893422 transitions. [2018-12-09 10:36:03,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:36:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 202943 states and 893422 transitions. [2018-12-09 10:36:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 10:36:03,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:03,063 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 10:36:03,063 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:03,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 281236806, now seen corresponding path program 1 times [2018-12-09 10:36:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:03,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:03,116 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 10:36:03,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:36:03,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:03,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:36:03,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:36:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:36:03,117 INFO L87 Difference]: Start difference. First operand 202943 states and 893422 transitions. Second operand 6 states. [2018-12-09 10:36:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:07,692 INFO L93 Difference]: Finished difference Result 356178 states and 1552140 transitions. [2018-12-09 10:36:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:36:07,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 10:36:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:08,586 INFO L225 Difference]: With dead ends: 356178 [2018-12-09 10:36:08,586 INFO L226 Difference]: Without dead ends: 352828 [2018-12-09 10:36:08,586 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 10:36:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352828 states. [2018-12-09 10:36:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352828 to 205748. [2018-12-09 10:36:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205748 states. [2018-12-09 10:36:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205748 states to 205748 states and 906656 transitions. [2018-12-09 10:36:14,422 INFO L78 Accepts]: Start accepts. Automaton has 205748 states and 906656 transitions. Word has length 64 [2018-12-09 10:36:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:14,422 INFO L480 AbstractCegarLoop]: Abstraction has 205748 states and 906656 transitions. [2018-12-09 10:36:14,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:36:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 205748 states and 906656 transitions. [2018-12-09 10:36:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 10:36:14,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:14,451 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 10:36:14,451 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:14,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1440890515, now seen corresponding path program 1 times [2018-12-09 10:36:14,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:14,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:14,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:14,504 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 10:36:14,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:36:14,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:14,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:36:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:36:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:36:14,505 INFO L87 Difference]: Start difference. First operand 205748 states and 906656 transitions. Second operand 6 states. [2018-12-09 10:36:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:16,061 INFO L93 Difference]: Finished difference Result 284253 states and 1239490 transitions. [2018-12-09 10:36:16,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:36:16,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 10:36:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:17,265 INFO L225 Difference]: With dead ends: 284253 [2018-12-09 10:36:17,265 INFO L226 Difference]: Without dead ends: 278558 [2018-12-09 10:36:17,265 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 10:36:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278558 states. [2018-12-09 10:36:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278558 to 261033. [2018-12-09 10:36:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261033 states. [2018-12-09 10:36:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261033 states to 261033 states and 1142709 transitions. [2018-12-09 10:36:25,174 INFO L78 Accepts]: Start accepts. Automaton has 261033 states and 1142709 transitions. Word has length 64 [2018-12-09 10:36:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:25,175 INFO L480 AbstractCegarLoop]: Abstraction has 261033 states and 1142709 transitions. [2018-12-09 10:36:25,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:36:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 261033 states and 1142709 transitions. [2018-12-09 10:36:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 10:36:25,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:25,214 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 10:36:25,215 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:25,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash -356060844, now seen corresponding path program 1 times [2018-12-09 10:36:25,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:25,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:25,269 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 10:36:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:25,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:36:25,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:25,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:36:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:36:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:36:25,270 INFO L87 Difference]: Start difference. First operand 261033 states and 1142709 transitions. Second operand 7 states. [2018-12-09 10:36:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:27,705 INFO L93 Difference]: Finished difference Result 379448 states and 1607926 transitions. [2018-12-09 10:36:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:36:27,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-09 10:36:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:29,276 INFO L225 Difference]: With dead ends: 379448 [2018-12-09 10:36:29,276 INFO L226 Difference]: Without dead ends: 379448 [2018-12-09 10:36:29,276 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 10:36:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379448 states. [2018-12-09 10:36:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379448 to 308623. [2018-12-09 10:36:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308623 states. [2018-12-09 10:36:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308623 states to 308623 states and 1326666 transitions. [2018-12-09 10:36:39,107 INFO L78 Accepts]: Start accepts. Automaton has 308623 states and 1326666 transitions. Word has length 64 [2018-12-09 10:36:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:39,107 INFO L480 AbstractCegarLoop]: Abstraction has 308623 states and 1326666 transitions. [2018-12-09 10:36:39,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:36:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 308623 states and 1326666 transitions. [2018-12-09 10:36:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 10:36:39,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:39,147 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 10:36:39,148 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:39,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 531442837, now seen corresponding path program 1 times [2018-12-09 10:36:39,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:39,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:39,183 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 10:36:39,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:39,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:36:39,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:39,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:36:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:36:39,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:36:39,184 INFO L87 Difference]: Start difference. First operand 308623 states and 1326666 transitions. Second operand 4 states. [2018-12-09 10:36:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:40,810 INFO L93 Difference]: Finished difference Result 267156 states and 1127024 transitions. [2018-12-09 10:36:40,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:36:40,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 10:36:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:41,477 INFO L225 Difference]: With dead ends: 267156 [2018-12-09 10:36:41,477 INFO L226 Difference]: Without dead ends: 259071 [2018-12-09 10:36:41,478 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 10:36:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259071 states. [2018-12-09 10:36:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259071 to 259071. [2018-12-09 10:36:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259071 states. [2018-12-09 10:36:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259071 states to 259071 states and 1099302 transitions. [2018-12-09 10:36:46,922 INFO L78 Accepts]: Start accepts. Automaton has 259071 states and 1099302 transitions. Word has length 64 [2018-12-09 10:36:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:46,922 INFO L480 AbstractCegarLoop]: Abstraction has 259071 states and 1099302 transitions. [2018-12-09 10:36:46,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:36:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 259071 states and 1099302 transitions. [2018-12-09 10:36:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 10:36:46,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:46,957 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] [2018-12-09 10:36:46,958 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:46,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash 757118313, now seen corresponding path program 1 times [2018-12-09 10:36:46,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:46,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:46,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:46,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:46,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 10:36:46,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:46,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:36:46,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:46,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:36:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:36:46,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:36:46,984 INFO L87 Difference]: Start difference. First operand 259071 states and 1099302 transitions. Second operand 5 states. [2018-12-09 10:36:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:47,206 INFO L93 Difference]: Finished difference Result 57903 states and 224526 transitions. [2018-12-09 10:36:47,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:36:47,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 10:36:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:47,312 INFO L225 Difference]: With dead ends: 57903 [2018-12-09 10:36:47,312 INFO L226 Difference]: Without dead ends: 50987 [2018-12-09 10:36:47,313 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 10:36:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50987 states. [2018-12-09 10:36:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50987 to 50747. [2018-12-09 10:36:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50747 states. [2018-12-09 10:36:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50747 states to 50747 states and 196313 transitions. [2018-12-09 10:36:48,023 INFO L78 Accepts]: Start accepts. Automaton has 50747 states and 196313 transitions. Word has length 65 [2018-12-09 10:36:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:48,023 INFO L480 AbstractCegarLoop]: Abstraction has 50747 states and 196313 transitions. [2018-12-09 10:36:48,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:36:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 50747 states and 196313 transitions. [2018-12-09 10:36:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 10:36:48,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:48,039 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] [2018-12-09 10:36:48,039 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:48,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash -229270171, now seen corresponding path program 1 times [2018-12-09 10:36:48,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:48,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:48,081 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 10:36:48,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:48,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:36:48,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:48,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:36:48,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:36:48,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:36:48,082 INFO L87 Difference]: Start difference. First operand 50747 states and 196313 transitions. Second operand 4 states. [2018-12-09 10:36:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:48,349 INFO L93 Difference]: Finished difference Result 59866 states and 230932 transitions. [2018-12-09 10:36:48,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:36:48,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-09 10:36:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:48,463 INFO L225 Difference]: With dead ends: 59866 [2018-12-09 10:36:48,463 INFO L226 Difference]: Without dead ends: 59866 [2018-12-09 10:36:48,464 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 10:36:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59866 states. [2018-12-09 10:36:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59866 to 53962. [2018-12-09 10:36:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53962 states. [2018-12-09 10:36:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53962 states to 53962 states and 208380 transitions. [2018-12-09 10:36:50,351 INFO L78 Accepts]: Start accepts. Automaton has 53962 states and 208380 transitions. Word has length 75 [2018-12-09 10:36:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:50,351 INFO L480 AbstractCegarLoop]: Abstraction has 53962 states and 208380 transitions. [2018-12-09 10:36:50,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:36:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 53962 states and 208380 transitions. [2018-12-09 10:36:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 10:36:50,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:50,368 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] [2018-12-09 10:36:50,368 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:50,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1513540164, now seen corresponding path program 1 times [2018-12-09 10:36:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:50,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:50,434 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 10:36:50,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:50,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:36:50,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:50,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:36:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:36:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:36:50,435 INFO L87 Difference]: Start difference. First operand 53962 states and 208380 transitions. Second operand 6 states. [2018-12-09 10:36:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:51,011 INFO L93 Difference]: Finished difference Result 98121 states and 377174 transitions. [2018-12-09 10:36:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:36:51,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-09 10:36:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:51,203 INFO L225 Difference]: With dead ends: 98121 [2018-12-09 10:36:51,203 INFO L226 Difference]: Without dead ends: 97801 [2018-12-09 10:36:51,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:36:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97801 states. [2018-12-09 10:36:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97801 to 58187. [2018-12-09 10:36:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58187 states. [2018-12-09 10:36:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58187 states to 58187 states and 223571 transitions. [2018-12-09 10:36:52,384 INFO L78 Accepts]: Start accepts. Automaton has 58187 states and 223571 transitions. Word has length 75 [2018-12-09 10:36:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:52,384 INFO L480 AbstractCegarLoop]: Abstraction has 58187 states and 223571 transitions. [2018-12-09 10:36:52,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:36:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 58187 states and 223571 transitions. [2018-12-09 10:36:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 10:36:52,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:52,407 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] [2018-12-09 10:36:52,407 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:52,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1542588999, now seen corresponding path program 1 times [2018-12-09 10:36:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:52,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:52,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:52,453 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 10:36:52,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:52,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:36:52,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:52,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:36:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:36:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:36:52,453 INFO L87 Difference]: Start difference. First operand 58187 states and 223571 transitions. Second operand 4 states. [2018-12-09 10:36:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:52,844 INFO L93 Difference]: Finished difference Result 73350 states and 278575 transitions. [2018-12-09 10:36:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:36:52,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 10:36:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:52,972 INFO L225 Difference]: With dead ends: 73350 [2018-12-09 10:36:52,972 INFO L226 Difference]: Without dead ends: 73350 [2018-12-09 10:36:52,972 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 10:36:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73350 states. [2018-12-09 10:36:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73350 to 66714. [2018-12-09 10:36:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66714 states. [2018-12-09 10:36:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66714 states to 66714 states and 254003 transitions. [2018-12-09 10:36:54,072 INFO L78 Accepts]: Start accepts. Automaton has 66714 states and 254003 transitions. Word has length 77 [2018-12-09 10:36:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:54,072 INFO L480 AbstractCegarLoop]: Abstraction has 66714 states and 254003 transitions. [2018-12-09 10:36:54,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:36:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 66714 states and 254003 transitions. [2018-12-09 10:36:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 10:36:54,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:54,104 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] [2018-12-09 10:36:54,104 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:54,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 675168954, now seen corresponding path program 1 times [2018-12-09 10:36:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:54,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:54,135 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 10:36:54,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:36:54,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:54,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:36:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:36:54,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:36:54,137 INFO L87 Difference]: Start difference. First operand 66714 states and 254003 transitions. Second operand 3 states. [2018-12-09 10:36:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:54,459 INFO L93 Difference]: Finished difference Result 69476 states and 263648 transitions. [2018-12-09 10:36:54,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:36:54,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-09 10:36:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:54,589 INFO L225 Difference]: With dead ends: 69476 [2018-12-09 10:36:54,589 INFO L226 Difference]: Without dead ends: 69476 [2018-12-09 10:36:54,589 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 10:36:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69476 states. [2018-12-09 10:36:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69476 to 68224. [2018-12-09 10:36:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68224 states. [2018-12-09 10:36:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68224 states to 68224 states and 259247 transitions. [2018-12-09 10:36:55,756 INFO L78 Accepts]: Start accepts. Automaton has 68224 states and 259247 transitions. Word has length 77 [2018-12-09 10:36:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:55,756 INFO L480 AbstractCegarLoop]: Abstraction has 68224 states and 259247 transitions. [2018-12-09 10:36:55,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:36:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 68224 states and 259247 transitions. [2018-12-09 10:36:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:36:55,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:55,798 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] [2018-12-09 10:36:55,798 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:55,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash -935757050, now seen corresponding path program 1 times [2018-12-09 10:36:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:55,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:55,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:55,844 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 10:36:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:36:55,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:55,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:36:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:36:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:36:55,845 INFO L87 Difference]: Start difference. First operand 68224 states and 259247 transitions. Second operand 6 states. [2018-12-09 10:36:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:56,544 INFO L93 Difference]: Finished difference Result 82931 states and 311778 transitions. [2018-12-09 10:36:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:36:56,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 10:36:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:56,682 INFO L225 Difference]: With dead ends: 82931 [2018-12-09 10:36:56,682 INFO L226 Difference]: Without dead ends: 82931 [2018-12-09 10:36:56,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 10:36:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82931 states. [2018-12-09 10:36:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82931 to 78447. [2018-12-09 10:36:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78447 states. [2018-12-09 10:36:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78447 states to 78447 states and 296296 transitions. [2018-12-09 10:36:58,022 INFO L78 Accepts]: Start accepts. Automaton has 78447 states and 296296 transitions. Word has length 79 [2018-12-09 10:36:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:58,023 INFO L480 AbstractCegarLoop]: Abstraction has 78447 states and 296296 transitions. [2018-12-09 10:36:58,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:36:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 78447 states and 296296 transitions. [2018-12-09 10:36:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:36:58,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:36:58,066 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] [2018-12-09 10:36:58,066 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:36:58,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:36:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1282000903, now seen corresponding path program 1 times [2018-12-09 10:36:58,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:36:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:58,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:36:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:36:58,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:36:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:36:58,120 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 10:36:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:36:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:36:58,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:36:58,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:36:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:36:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:36:58,121 INFO L87 Difference]: Start difference. First operand 78447 states and 296296 transitions. Second operand 6 states. [2018-12-09 10:36:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:36:58,619 INFO L93 Difference]: Finished difference Result 91981 states and 338639 transitions. [2018-12-09 10:36:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:36:58,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 10:36:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:36:58,789 INFO L225 Difference]: With dead ends: 91981 [2018-12-09 10:36:58,789 INFO L226 Difference]: Without dead ends: 91981 [2018-12-09 10:36:58,789 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 10:36:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91981 states. [2018-12-09 10:36:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91981 to 80036. [2018-12-09 10:36:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80036 states. [2018-12-09 10:36:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80036 states to 80036 states and 297461 transitions. [2018-12-09 10:36:59,970 INFO L78 Accepts]: Start accepts. Automaton has 80036 states and 297461 transitions. Word has length 79 [2018-12-09 10:36:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:36:59,970 INFO L480 AbstractCegarLoop]: Abstraction has 80036 states and 297461 transitions. [2018-12-09 10:36:59,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:36:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 80036 states and 297461 transitions. [2018-12-09 10:37:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:37:00,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:00,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, 1, 1, 1, 1, 1, 1, 1, 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 10:37:00,017 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:00,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1493351816, now seen corresponding path program 1 times [2018-12-09 10:37:00,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:00,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:00,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:00,073 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 10:37:00,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:00,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:37:00,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:00,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:37:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:37:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:37:00,074 INFO L87 Difference]: Start difference. First operand 80036 states and 297461 transitions. Second operand 5 states. [2018-12-09 10:37:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:00,684 INFO L93 Difference]: Finished difference Result 101345 states and 374909 transitions. [2018-12-09 10:37:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:37:00,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-09 10:37:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:00,888 INFO L225 Difference]: With dead ends: 101345 [2018-12-09 10:37:00,888 INFO L226 Difference]: Without dead ends: 101345 [2018-12-09 10:37:00,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:37:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101345 states. [2018-12-09 10:37:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101345 to 85991. [2018-12-09 10:37:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85991 states. [2018-12-09 10:37:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85991 states to 85991 states and 317479 transitions. [2018-12-09 10:37:02,181 INFO L78 Accepts]: Start accepts. Automaton has 85991 states and 317479 transitions. Word has length 79 [2018-12-09 10:37:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:02,181 INFO L480 AbstractCegarLoop]: Abstraction has 85991 states and 317479 transitions. [2018-12-09 10:37:02,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:37:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 85991 states and 317479 transitions. [2018-12-09 10:37:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:37:02,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:02,232 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] [2018-12-09 10:37:02,232 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:02,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash 982817639, now seen corresponding path program 1 times [2018-12-09 10:37:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:02,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:02,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:02,265 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 10:37:02,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:02,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:37:02,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:02,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:37:02,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:37:02,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:37:02,265 INFO L87 Difference]: Start difference. First operand 85991 states and 317479 transitions. Second operand 5 states. [2018-12-09 10:37:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:02,969 INFO L93 Difference]: Finished difference Result 115114 states and 423727 transitions. [2018-12-09 10:37:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:37:02,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-09 10:37:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:03,190 INFO L225 Difference]: With dead ends: 115114 [2018-12-09 10:37:03,190 INFO L226 Difference]: Without dead ends: 115114 [2018-12-09 10:37:03,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 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 10:37:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115114 states. [2018-12-09 10:37:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115114 to 90924. [2018-12-09 10:37:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90924 states. [2018-12-09 10:37:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90924 states to 90924 states and 335673 transitions. [2018-12-09 10:37:04,667 INFO L78 Accepts]: Start accepts. Automaton has 90924 states and 335673 transitions. Word has length 79 [2018-12-09 10:37:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:04,667 INFO L480 AbstractCegarLoop]: Abstraction has 90924 states and 335673 transitions. [2018-12-09 10:37:04,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:37:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 90924 states and 335673 transitions. [2018-12-09 10:37:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:37:04,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:04,886 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] [2018-12-09 10:37:04,887 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:04,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash -824636824, now seen corresponding path program 1 times [2018-12-09 10:37:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:04,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:04,924 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 10:37:04,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:04,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:37:04,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:04,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:37:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:37:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:37:04,925 INFO L87 Difference]: Start difference. First operand 90924 states and 335673 transitions. Second operand 6 states. [2018-12-09 10:37:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:05,040 INFO L93 Difference]: Finished difference Result 32108 states and 101609 transitions. [2018-12-09 10:37:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:37:05,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 10:37:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:05,074 INFO L225 Difference]: With dead ends: 32108 [2018-12-09 10:37:05,074 INFO L226 Difference]: Without dead ends: 25827 [2018-12-09 10:37:05,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:37:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25827 states. [2018-12-09 10:37:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25827 to 22407. [2018-12-09 10:37:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2018-12-09 10:37:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 70116 transitions. [2018-12-09 10:37:05,322 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 70116 transitions. Word has length 79 [2018-12-09 10:37:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:05,322 INFO L480 AbstractCegarLoop]: Abstraction has 22407 states and 70116 transitions. [2018-12-09 10:37:05,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:37:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 70116 transitions. [2018-12-09 10:37:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:37:05,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:05,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:05,343 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:05,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1435852254, now seen corresponding path program 1 times [2018-12-09 10:37:05,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:05,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:05,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:05,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:05,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:05,400 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 10:37:05,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:05,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:37:05,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:05,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:37:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:37:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:37:05,401 INFO L87 Difference]: Start difference. First operand 22407 states and 70116 transitions. Second operand 7 states. [2018-12-09 10:37:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:05,701 INFO L93 Difference]: Finished difference Result 28185 states and 87909 transitions. [2018-12-09 10:37:05,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:37:05,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 10:37:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:05,734 INFO L225 Difference]: With dead ends: 28185 [2018-12-09 10:37:05,734 INFO L226 Difference]: Without dead ends: 28185 [2018-12-09 10:37:05,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:37:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2018-12-09 10:37:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 23157. [2018-12-09 10:37:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23157 states. [2018-12-09 10:37:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23157 states to 23157 states and 72666 transitions. [2018-12-09 10:37:06,005 INFO L78 Accepts]: Start accepts. Automaton has 23157 states and 72666 transitions. Word has length 94 [2018-12-09 10:37:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:06,006 INFO L480 AbstractCegarLoop]: Abstraction has 23157 states and 72666 transitions. [2018-12-09 10:37:06,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:37:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23157 states and 72666 transitions. [2018-12-09 10:37:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:37:06,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:06,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:06,027 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:06,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1105280225, now seen corresponding path program 1 times [2018-12-09 10:37:06,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:06,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:06,073 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 10:37:06,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:06,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:37:06,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:06,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:37:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:37:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:37:06,074 INFO L87 Difference]: Start difference. First operand 23157 states and 72666 transitions. Second operand 5 states. [2018-12-09 10:37:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:06,260 INFO L93 Difference]: Finished difference Result 26791 states and 83200 transitions. [2018-12-09 10:37:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:37:06,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 10:37:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:06,290 INFO L225 Difference]: With dead ends: 26791 [2018-12-09 10:37:06,291 INFO L226 Difference]: Without dead ends: 26621 [2018-12-09 10:37:06,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 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 10:37:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26621 states. [2018-12-09 10:37:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26621 to 23937. [2018-12-09 10:37:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23937 states. [2018-12-09 10:37:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23937 states to 23937 states and 74830 transitions. [2018-12-09 10:37:06,555 INFO L78 Accepts]: Start accepts. Automaton has 23937 states and 74830 transitions. Word has length 94 [2018-12-09 10:37:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:06,555 INFO L480 AbstractCegarLoop]: Abstraction has 23937 states and 74830 transitions. [2018-12-09 10:37:06,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:37:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23937 states and 74830 transitions. [2018-12-09 10:37:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:37:06,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:06,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:06,578 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:06,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:06,578 INFO L82 PathProgramCache]: Analyzing trace with hash 301893331, now seen corresponding path program 2 times [2018-12-09 10:37:06,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:06,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:06,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:06,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:06,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:06,640 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 10:37:06,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:06,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:37:06,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:06,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:37:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:37:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:37:06,641 INFO L87 Difference]: Start difference. First operand 23937 states and 74830 transitions. Second operand 6 states. [2018-12-09 10:37:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:06,746 INFO L93 Difference]: Finished difference Result 23873 states and 74046 transitions. [2018-12-09 10:37:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:37:06,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 10:37:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:06,771 INFO L225 Difference]: With dead ends: 23873 [2018-12-09 10:37:06,771 INFO L226 Difference]: Without dead ends: 23873 [2018-12-09 10:37:06,771 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 10:37:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23873 states. [2018-12-09 10:37:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23873 to 16029. [2018-12-09 10:37:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2018-12-09 10:37:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 50194 transitions. [2018-12-09 10:37:06,979 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 50194 transitions. Word has length 94 [2018-12-09 10:37:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:06,980 INFO L480 AbstractCegarLoop]: Abstraction has 16029 states and 50194 transitions. [2018-12-09 10:37:06,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:37:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 50194 transitions. [2018-12-09 10:37:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:37:06,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:06,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:06,994 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:06,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -18809202, now seen corresponding path program 1 times [2018-12-09 10:37:06,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:06,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:37:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:06,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:07,064 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 10:37:07,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:07,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:37:07,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:07,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:37:07,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:37:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:37:07,065 INFO L87 Difference]: Start difference. First operand 16029 states and 50194 transitions. Second operand 8 states. [2018-12-09 10:37:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:07,345 INFO L93 Difference]: Finished difference Result 19086 states and 59342 transitions. [2018-12-09 10:37:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:37:07,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 10:37:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:07,369 INFO L225 Difference]: With dead ends: 19086 [2018-12-09 10:37:07,369 INFO L226 Difference]: Without dead ends: 19086 [2018-12-09 10:37:07,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:37:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2018-12-09 10:37:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 18317. [2018-12-09 10:37:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18317 states. [2018-12-09 10:37:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18317 states to 18317 states and 57195 transitions. [2018-12-09 10:37:07,552 INFO L78 Accepts]: Start accepts. Automaton has 18317 states and 57195 transitions. Word has length 96 [2018-12-09 10:37:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:07,553 INFO L480 AbstractCegarLoop]: Abstraction has 18317 states and 57195 transitions. [2018-12-09 10:37:07,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:37:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 18317 states and 57195 transitions. [2018-12-09 10:37:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:37:07,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:07,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:07,569 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:07,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 868694479, now seen corresponding path program 1 times [2018-12-09 10:37:07,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:07,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:07,667 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 10:37:07,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:07,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 10:37:07,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:07,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 10:37:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:37:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:37:07,668 INFO L87 Difference]: Start difference. First operand 18317 states and 57195 transitions. Second operand 11 states. [2018-12-09 10:37:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:08,575 INFO L93 Difference]: Finished difference Result 31408 states and 97769 transitions. [2018-12-09 10:37:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:37:08,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 10:37:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:08,597 INFO L225 Difference]: With dead ends: 31408 [2018-12-09 10:37:08,597 INFO L226 Difference]: Without dead ends: 21812 [2018-12-09 10:37:08,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 10:37:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21812 states. [2018-12-09 10:37:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21812 to 18647. [2018-12-09 10:37:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18647 states. [2018-12-09 10:37:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18647 states to 18647 states and 57939 transitions. [2018-12-09 10:37:08,800 INFO L78 Accepts]: Start accepts. Automaton has 18647 states and 57939 transitions. Word has length 96 [2018-12-09 10:37:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:08,800 INFO L480 AbstractCegarLoop]: Abstraction has 18647 states and 57939 transitions. [2018-12-09 10:37:08,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 10:37:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 18647 states and 57939 transitions. [2018-12-09 10:37:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:37:08,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:08,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:08,817 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:08,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1477933554, now seen corresponding path program 1 times [2018-12-09 10:37:08,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:08,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:08,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:08,890 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 10:37:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:37:08,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:08,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:37:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:37:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:37:08,892 INFO L87 Difference]: Start difference. First operand 18647 states and 57939 transitions. Second operand 7 states. [2018-12-09 10:37:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:09,315 INFO L93 Difference]: Finished difference Result 26000 states and 79822 transitions. [2018-12-09 10:37:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:37:09,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 10:37:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:09,346 INFO L225 Difference]: With dead ends: 26000 [2018-12-09 10:37:09,346 INFO L226 Difference]: Without dead ends: 25320 [2018-12-09 10:37:09,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:37:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25320 states. [2018-12-09 10:37:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25320 to 19167. [2018-12-09 10:37:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19167 states. [2018-12-09 10:37:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19167 states to 19167 states and 58870 transitions. [2018-12-09 10:37:09,580 INFO L78 Accepts]: Start accepts. Automaton has 19167 states and 58870 transitions. Word has length 96 [2018-12-09 10:37:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:09,580 INFO L480 AbstractCegarLoop]: Abstraction has 19167 states and 58870 transitions. [2018-12-09 10:37:09,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:37:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19167 states and 58870 transitions. [2018-12-09 10:37:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:37:09,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:09,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:09,597 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:09,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:09,597 INFO L82 PathProgramCache]: Analyzing trace with hash 739824399, now seen corresponding path program 2 times [2018-12-09 10:37:09,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:09,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:09,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:37:09,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:09,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:09,684 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 10:37:09,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:09,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 10:37:09,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:09,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 10:37:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:37:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:37:09,685 INFO L87 Difference]: Start difference. First operand 19167 states and 58870 transitions. Second operand 10 states. [2018-12-09 10:37:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:10,187 INFO L93 Difference]: Finished difference Result 35587 states and 108845 transitions. [2018-12-09 10:37:10,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:37:10,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 10:37:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:10,204 INFO L225 Difference]: With dead ends: 35587 [2018-12-09 10:37:10,204 INFO L226 Difference]: Without dead ends: 17179 [2018-12-09 10:37:10,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:37:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17179 states. [2018-12-09 10:37:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17179 to 17179. [2018-12-09 10:37:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17179 states. [2018-12-09 10:37:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17179 states to 17179 states and 52498 transitions. [2018-12-09 10:37:10,374 INFO L78 Accepts]: Start accepts. Automaton has 17179 states and 52498 transitions. Word has length 96 [2018-12-09 10:37:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:10,374 INFO L480 AbstractCegarLoop]: Abstraction has 17179 states and 52498 transitions. [2018-12-09 10:37:10,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 10:37:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 17179 states and 52498 transitions. [2018-12-09 10:37:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:37:10,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:10,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:10,390 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:10,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash -5061991, now seen corresponding path program 3 times [2018-12-09 10:37:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:10,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:37:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:10,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:37:10,466 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 10:37:10,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:37:10,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 10:37:10,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:37:10,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 10:37:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:37:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:37:10,467 INFO L87 Difference]: Start difference. First operand 17179 states and 52498 transitions. Second operand 10 states. [2018-12-09 10:37:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:37:10,879 INFO L93 Difference]: Finished difference Result 30297 states and 92556 transitions. [2018-12-09 10:37:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:37:10,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 10:37:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:37:10,891 INFO L225 Difference]: With dead ends: 30297 [2018-12-09 10:37:10,891 INFO L226 Difference]: Without dead ends: 11301 [2018-12-09 10:37:10,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:37:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2018-12-09 10:37:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11301. [2018-12-09 10:37:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11301 states. [2018-12-09 10:37:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11301 states to 11301 states and 34527 transitions. [2018-12-09 10:37:11,036 INFO L78 Accepts]: Start accepts. Automaton has 11301 states and 34527 transitions. Word has length 96 [2018-12-09 10:37:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:37:11,036 INFO L480 AbstractCegarLoop]: Abstraction has 11301 states and 34527 transitions. [2018-12-09 10:37:11,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 10:37:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11301 states and 34527 transitions. [2018-12-09 10:37:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:37:11,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:37:11,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:37:11,044 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:37:11,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:37:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash 272721815, now seen corresponding path program 4 times [2018-12-09 10:37:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:37:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:11,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:37:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:37:11,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:37:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:37:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:37:11,094 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:37:11,193 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:37:11,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:37:11 BasicIcfg [2018-12-09 10:37:11,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:37:11,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:37:11,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:37:11,195 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:37:11,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:35:10" (3/4) ... [2018-12-09 10:37:11,197 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:37:11,293 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e29f976a-a7c1-453a-b8e6-d095c7561c24/bin-2019/utaipan/witness.graphml [2018-12-09 10:37:11,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:37:11,294 INFO L168 Benchmark]: Toolchain (without parser) took 121784.15 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.8 GB). Free memory was 947.0 MB in the beginning and 6.7 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-09 10:37:11,295 INFO L168 Benchmark]: CDTParser took 0.16 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 10:37:11,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:37:11,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:37:11,296 INFO L168 Benchmark]: Boogie Preprocessor took 18.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:37:11,296 INFO L168 Benchmark]: RCFGBuilder took 348.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:37:11,296 INFO L168 Benchmark]: TraceAbstraction took 120934.30 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 10:37:11,296 INFO L168 Benchmark]: Witness Printer took 98.45 ms. Allocated memory is still 7.8 GB. Free memory was 6.7 GB in the beginning and 6.7 GB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:37:11,298 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.16 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 351.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 348.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 120934.30 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 98.45 ms. Allocated memory is still 7.8 GB. Free memory was 6.7 GB in the beginning and 6.7 GB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: 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] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L686] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L687] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L688] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L690] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L692] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L694] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L695] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L696] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L697] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L698] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L699] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L700] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L701] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L702] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L703] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L704] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L705] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L706] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L707] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L708] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L709] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L710] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L711] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L712] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] -1 pthread_t t866; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK -1 pthread_create(&t866, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] -1 pthread_t t867; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK -1 pthread_create(&t867, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] -1 pthread_t t868; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] FCALL, FORK -1 pthread_create(&t868, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 0 z$w_buff1 = z$w_buff0 [L766] 0 z$w_buff0 = 1 [L767] 0 z$w_buff1_used = z$w_buff0_used [L768] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L771] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L772] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L773] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L774] 0 z$r_buff0_thd3 = (_Bool)1 [L777] 0 a = 1 [L780] 0 __unbuffered_p2_EAX = a [L783] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L716] 1 b = 1 [L719] 1 __unbuffered_p0_EAX = x [L724] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 2 x = 1 [L734] 2 y = 1 [L737] 2 __unbuffered_p1_EAX = y [L740] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 2 z$flush_delayed = weak$$choice2 [L743] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 z = z$flush_delayed ? z$mem_tmp : z [L753] 2 z$flush_delayed = (_Bool)0 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L826] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 222 locations, 3 error locations. UNSAFE Result, 120.8s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 36.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8029 SDtfs, 10520 SDslu, 20190 SDs, 0 SdLazy, 7961 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 75 SyntacticMatches, 18 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308623occurred in iteration=8, 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: 63.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 572787 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2159 NumberOfCodeBlocks, 2159 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2036 ConstructedInterpolants, 0 QuantifiedInterpolants, 409617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...