./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/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 299cf90b3d63022a669c015dab67fb8f824b1c69 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:16:16,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:16:16,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:16:16,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:16:16,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:16:16,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:16:16,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:16:16,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:16:16,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:16:16,975 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:16:16,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:16:16,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:16:16,976 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:16:16,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:16:16,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:16:16,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:16:16,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:16:16,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:16:16,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:16:16,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:16:16,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:16:16,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:16:16,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:16:16,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:16:16,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:16:16,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:16:16,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:16:16,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:16:16,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:16:16,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:16:16,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:16:16,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:16:16,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:16:16,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:16:16,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:16:16,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:16:16,987 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:16:16,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:16:16,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:16:16,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:16:16,995 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:16:16,995 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:16:16,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:16:16,996 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:16:16,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:16:16,997 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:16:16,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:16:16,997 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:16:16,997 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:16:16,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:16:16,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:16:16,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:16:16,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:16:16,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:16:17,000 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:16:17,000 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_14ec13de-205b-4e73-ac63-77fa6a37d745/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 -> 299cf90b3d63022a669c015dab67fb8f824b1c69 [2018-12-09 00:16:17,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:16:17,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:16:17,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:16:17,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:16:17,030 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:16:17,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i [2018-12-09 00:16:17,074 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/data/6bb9b793c/b38f48d0162a41f88dcb40cca5536ded/FLAGd86c5b91b [2018-12-09 00:16:17,527 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:16:17,527 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i [2018-12-09 00:16:17,534 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/data/6bb9b793c/b38f48d0162a41f88dcb40cca5536ded/FLAGd86c5b91b [2018-12-09 00:16:17,543 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/data/6bb9b793c/b38f48d0162a41f88dcb40cca5536ded [2018-12-09 00:16:17,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:16:17,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:16:17,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:16:17,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:16:17,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:16:17,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17, skipping insertion in model container [2018-12-09 00:16:17,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:16:17,576 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:16:17,753 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:16:17,761 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:16:17,839 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:16:17,868 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:16:17,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17 WrapperNode [2018-12-09 00:16:17,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:16:17,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:16:17,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:16:17,869 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:16:17,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:16:17,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:16:17,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:16:17,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:16:17,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... [2018-12-09 00:16:17,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:16:17,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:16:17,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:16:17,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:16:17,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/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 00:16:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 00:16:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 00:16:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 00:16:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:16:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:16:17,954 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 00:16:18,246 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:16:18,246 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:16:18,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:16:18 BoogieIcfgContainer [2018-12-09 00:16:18,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:16:18,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:16:18,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:16:18,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:16:18,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:16:17" (1/3) ... [2018-12-09 00:16:18,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6992aef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:16:18, skipping insertion in model container [2018-12-09 00:16:18,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:16:17" (2/3) ... [2018-12-09 00:16:18,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6992aef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:16:18, skipping insertion in model container [2018-12-09 00:16:18,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:16:18" (3/3) ... [2018-12-09 00:16:18,252 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc_false-unreach-call.i [2018-12-09 00:16:18,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,284 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,284 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,284 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,285 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,285 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,292 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,308 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,308 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:16:18,312 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 00:16:18,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:16:18,319 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 00:16:18,333 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 00:16:18,349 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:16:18,349 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:16:18,349 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:16:18,350 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:16:18,350 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:16:18,350 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:16:18,350 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:16:18,350 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:16:18,359 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-12-09 00:16:19,877 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-12-09 00:16:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-12-09 00:16:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:16:19,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:19,884 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] [2018-12-09 00:16:19,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:19,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-12-09 00:16:19,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:19,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:16:20,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:20,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:20,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:20,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:20,038 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-12-09 00:16:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:20,553 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-12-09 00:16:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:16:20,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 00:16:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:20,737 INFO L225 Difference]: With dead ends: 60794 [2018-12-09 00:16:20,737 INFO L226 Difference]: Without dead ends: 44274 [2018-12-09 00:16:20,738 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 00:16:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-12-09 00:16:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-12-09 00:16:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-09 00:16:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-12-09 00:16:21,519 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-12-09 00:16:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:21,519 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-12-09 00:16:21,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-12-09 00:16:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 00:16:21,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:21,523 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 00:16:21,524 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:21,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-12-09 00:16:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:21,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:21,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:21,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:21,575 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 00:16:21,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:21,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:21,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:21,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:21,577 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 4 states. [2018-12-09 00:16:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:21,641 INFO L93 Difference]: Finished difference Result 8532 states and 28348 transitions. [2018-12-09 00:16:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:16:21,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 00:16:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:21,656 INFO L225 Difference]: With dead ends: 8532 [2018-12-09 00:16:21,656 INFO L226 Difference]: Without dead ends: 7470 [2018-12-09 00:16:21,657 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 00:16:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-09 00:16:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 7470. [2018-12-09 00:16:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7470 states. [2018-12-09 00:16:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 24640 transitions. [2018-12-09 00:16:21,743 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 24640 transitions. Word has length 49 [2018-12-09 00:16:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:21,744 INFO L480 AbstractCegarLoop]: Abstraction has 7470 states and 24640 transitions. [2018-12-09 00:16:21,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 24640 transitions. [2018-12-09 00:16:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 00:16:21,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:21,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:16:21,745 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:21,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-12-09 00:16:21,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:21,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:21,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:21,795 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 00:16:21,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:21,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:21,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:21,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:21,796 INFO L87 Difference]: Start difference. First operand 7470 states and 24640 transitions. Second operand 5 states. [2018-12-09 00:16:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:22,004 INFO L93 Difference]: Finished difference Result 14002 states and 45809 transitions. [2018-12-09 00:16:22,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:22,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 00:16:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:22,026 INFO L225 Difference]: With dead ends: 14002 [2018-12-09 00:16:22,026 INFO L226 Difference]: Without dead ends: 13934 [2018-12-09 00:16:22,026 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 00:16:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13934 states. [2018-12-09 00:16:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13934 to 9445. [2018-12-09 00:16:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-12-09 00:16:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 30546 transitions. [2018-12-09 00:16:22,151 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 30546 transitions. Word has length 50 [2018-12-09 00:16:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 30546 transitions. [2018-12-09 00:16:22,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 30546 transitions. [2018-12-09 00:16:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:16:22,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:22,154 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] [2018-12-09 00:16:22,154 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:22,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-12-09 00:16:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:22,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:22,187 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 00:16:22,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:22,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:16:22,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:22,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:16:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:16:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:16:22,188 INFO L87 Difference]: Start difference. First operand 9445 states and 30546 transitions. Second operand 3 states. [2018-12-09 00:16:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:22,282 INFO L93 Difference]: Finished difference Result 13283 states and 42645 transitions. [2018-12-09 00:16:22,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:16:22,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 00:16:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:22,298 INFO L225 Difference]: With dead ends: 13283 [2018-12-09 00:16:22,298 INFO L226 Difference]: Without dead ends: 13283 [2018-12-09 00:16:22,298 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 00:16:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2018-12-09 00:16:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 9849. [2018-12-09 00:16:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2018-12-09 00:16:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 31512 transitions. [2018-12-09 00:16:22,428 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 31512 transitions. Word has length 52 [2018-12-09 00:16:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:22,428 INFO L480 AbstractCegarLoop]: Abstraction has 9849 states and 31512 transitions. [2018-12-09 00:16:22,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:16:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 31512 transitions. [2018-12-09 00:16:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:16:22,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:22,429 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] [2018-12-09 00:16:22,430 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:22,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-12-09 00:16:22,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:22,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:22,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:22,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:22,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:22,480 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 00:16:22,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:22,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:16:22,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:22,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:16:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:16:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:16:22,481 INFO L87 Difference]: Start difference. First operand 9849 states and 31512 transitions. Second operand 6 states. [2018-12-09 00:16:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:22,734 INFO L93 Difference]: Finished difference Result 14207 states and 45068 transitions. [2018-12-09 00:16:22,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:16:22,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 00:16:22,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:22,751 INFO L225 Difference]: With dead ends: 14207 [2018-12-09 00:16:22,751 INFO L226 Difference]: Without dead ends: 14135 [2018-12-09 00:16:22,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:16:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2018-12-09 00:16:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 10853. [2018-12-09 00:16:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-12-09 00:16:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 34567 transitions. [2018-12-09 00:16:22,879 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 34567 transitions. Word has length 56 [2018-12-09 00:16:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:22,880 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 34567 transitions. [2018-12-09 00:16:22,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:16:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 34567 transitions. [2018-12-09 00:16:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:16:22,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:22,883 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 00:16:22,883 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:22,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-12-09 00:16:22,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:22,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:22,914 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 00:16:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:22,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:22,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:22,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:22,915 INFO L87 Difference]: Start difference. First operand 10853 states and 34567 transitions. Second operand 4 states. [2018-12-09 00:16:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:22,991 INFO L93 Difference]: Finished difference Result 12400 states and 39576 transitions. [2018-12-09 00:16:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:16:22,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 00:16:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:23,005 INFO L225 Difference]: With dead ends: 12400 [2018-12-09 00:16:23,005 INFO L226 Difference]: Without dead ends: 12400 [2018-12-09 00:16:23,006 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 00:16:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2018-12-09 00:16:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11373. [2018-12-09 00:16:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2018-12-09 00:16:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 36240 transitions. [2018-12-09 00:16:23,125 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 36240 transitions. Word has length 64 [2018-12-09 00:16:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:23,125 INFO L480 AbstractCegarLoop]: Abstraction has 11373 states and 36240 transitions. [2018-12-09 00:16:23,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 36240 transitions. [2018-12-09 00:16:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:16:23,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:23,128 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 00:16:23,128 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:23,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-12-09 00:16:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:23,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:23,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:23,178 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 00:16:23,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:23,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:16:23,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:23,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:16:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:16:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:16:23,179 INFO L87 Difference]: Start difference. First operand 11373 states and 36240 transitions. Second operand 6 states. [2018-12-09 00:16:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:23,503 INFO L93 Difference]: Finished difference Result 20973 states and 66490 transitions. [2018-12-09 00:16:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:16:23,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 00:16:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:23,530 INFO L225 Difference]: With dead ends: 20973 [2018-12-09 00:16:23,530 INFO L226 Difference]: Without dead ends: 20902 [2018-12-09 00:16:23,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:16:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2018-12-09 00:16:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 13759. [2018-12-09 00:16:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-09 00:16:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 43284 transitions. [2018-12-09 00:16:23,759 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 43284 transitions. Word has length 64 [2018-12-09 00:16:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:23,759 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 43284 transitions. [2018-12-09 00:16:23,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:16:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 43284 transitions. [2018-12-09 00:16:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 00:16:23,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:23,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:16:23,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:23,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1129581006, now seen corresponding path program 1 times [2018-12-09 00:16:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:23,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:23,804 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 00:16:23,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:23,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:23,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:23,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:23,805 INFO L87 Difference]: Start difference. First operand 13759 states and 43284 transitions. Second operand 4 states. [2018-12-09 00:16:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:23,997 INFO L93 Difference]: Finished difference Result 17639 states and 54589 transitions. [2018-12-09 00:16:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:16:23,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 00:16:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:24,023 INFO L225 Difference]: With dead ends: 17639 [2018-12-09 00:16:24,023 INFO L226 Difference]: Without dead ends: 17639 [2018-12-09 00:16:24,023 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 00:16:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2018-12-09 00:16:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 15797. [2018-12-09 00:16:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15797 states. [2018-12-09 00:16:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 49135 transitions. [2018-12-09 00:16:24,197 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 49135 transitions. Word has length 68 [2018-12-09 00:16:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:24,197 INFO L480 AbstractCegarLoop]: Abstraction has 15797 states and 49135 transitions. [2018-12-09 00:16:24,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 49135 transitions. [2018-12-09 00:16:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 00:16:24,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:24,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:16:24,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:24,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -947628337, now seen corresponding path program 1 times [2018-12-09 00:16:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:24,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:24,232 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 00:16:24,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:24,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:16:24,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:24,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:16:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:16:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:16:24,233 INFO L87 Difference]: Start difference. First operand 15797 states and 49135 transitions. Second operand 3 states. [2018-12-09 00:16:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:24,371 INFO L93 Difference]: Finished difference Result 16389 states and 50742 transitions. [2018-12-09 00:16:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:16:24,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 00:16:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:24,388 INFO L225 Difference]: With dead ends: 16389 [2018-12-09 00:16:24,389 INFO L226 Difference]: Without dead ends: 16389 [2018-12-09 00:16:24,389 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 00:16:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16389 states. [2018-12-09 00:16:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16389 to 16113. [2018-12-09 00:16:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16113 states. [2018-12-09 00:16:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16113 states to 16113 states and 49985 transitions. [2018-12-09 00:16:24,552 INFO L78 Accepts]: Start accepts. Automaton has 16113 states and 49985 transitions. Word has length 68 [2018-12-09 00:16:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:24,553 INFO L480 AbstractCegarLoop]: Abstraction has 16113 states and 49985 transitions. [2018-12-09 00:16:24,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:16:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16113 states and 49985 transitions. [2018-12-09 00:16:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:24,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:24,559 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] [2018-12-09 00:16:24,559 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:24,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-12-09 00:16:24,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:24,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:24,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:24,614 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 00:16:24,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:24,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:16:24,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:24,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:16:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:16:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:16:24,614 INFO L87 Difference]: Start difference. First operand 16113 states and 49985 transitions. Second operand 6 states. [2018-12-09 00:16:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:25,245 INFO L93 Difference]: Finished difference Result 19825 states and 60441 transitions. [2018-12-09 00:16:25,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:25,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-09 00:16:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:25,266 INFO L225 Difference]: With dead ends: 19825 [2018-12-09 00:16:25,266 INFO L226 Difference]: Without dead ends: 19825 [2018-12-09 00:16:25,267 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 00:16:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2018-12-09 00:16:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 18621. [2018-12-09 00:16:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2018-12-09 00:16:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 57221 transitions. [2018-12-09 00:16:25,464 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 57221 transitions. Word has length 70 [2018-12-09 00:16:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:25,464 INFO L480 AbstractCegarLoop]: Abstraction has 18621 states and 57221 transitions. [2018-12-09 00:16:25,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:16:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 57221 transitions. [2018-12-09 00:16:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:25,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:25,471 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] [2018-12-09 00:16:25,471 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:25,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-12-09 00:16:25,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:25,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:25,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:25,531 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 00:16:25,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:25,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:25,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:25,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:25,532 INFO L87 Difference]: Start difference. First operand 18621 states and 57221 transitions. Second operand 5 states. [2018-12-09 00:16:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:25,755 INFO L93 Difference]: Finished difference Result 24184 states and 73726 transitions. [2018-12-09 00:16:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:25,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 00:16:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:25,780 INFO L225 Difference]: With dead ends: 24184 [2018-12-09 00:16:25,780 INFO L226 Difference]: Without dead ends: 24184 [2018-12-09 00:16:25,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:16:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24184 states. [2018-12-09 00:16:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24184 to 22021. [2018-12-09 00:16:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2018-12-09 00:16:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 67146 transitions. [2018-12-09 00:16:26,020 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 67146 transitions. Word has length 70 [2018-12-09 00:16:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:26,020 INFO L480 AbstractCegarLoop]: Abstraction has 22021 states and 67146 transitions. [2018-12-09 00:16:26,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 67146 transitions. [2018-12-09 00:16:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:26,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:26,028 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] [2018-12-09 00:16:26,028 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:26,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:26,028 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-12-09 00:16:26,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:26,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:26,082 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 00:16:26,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:26,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:26,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:26,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:26,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:26,083 INFO L87 Difference]: Start difference. First operand 22021 states and 67146 transitions. Second operand 5 states. [2018-12-09 00:16:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:26,406 INFO L93 Difference]: Finished difference Result 30767 states and 92772 transitions. [2018-12-09 00:16:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:16:26,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 00:16:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:26,441 INFO L225 Difference]: With dead ends: 30767 [2018-12-09 00:16:26,442 INFO L226 Difference]: Without dead ends: 30767 [2018-12-09 00:16:26,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 00:16:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30767 states. [2018-12-09 00:16:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30767 to 27531. [2018-12-09 00:16:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2018-12-09 00:16:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 83463 transitions. [2018-12-09 00:16:26,778 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 83463 transitions. Word has length 70 [2018-12-09 00:16:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:26,778 INFO L480 AbstractCegarLoop]: Abstraction has 27531 states and 83463 transitions. [2018-12-09 00:16:26,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 83463 transitions. [2018-12-09 00:16:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:26,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:26,789 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] [2018-12-09 00:16:26,789 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:26,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-12-09 00:16:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:26,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:26,824 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 00:16:26,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:26,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:26,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:26,825 INFO L87 Difference]: Start difference. First operand 27531 states and 83463 transitions. Second operand 4 states. [2018-12-09 00:16:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:27,263 INFO L93 Difference]: Finished difference Result 37927 states and 115324 transitions. [2018-12-09 00:16:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:16:27,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-09 00:16:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:27,370 INFO L225 Difference]: With dead ends: 37927 [2018-12-09 00:16:27,370 INFO L226 Difference]: Without dead ends: 37711 [2018-12-09 00:16:27,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37711 states. [2018-12-09 00:16:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37711 to 34931. [2018-12-09 00:16:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34931 states. [2018-12-09 00:16:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34931 states to 34931 states and 106353 transitions. [2018-12-09 00:16:27,732 INFO L78 Accepts]: Start accepts. Automaton has 34931 states and 106353 transitions. Word has length 70 [2018-12-09 00:16:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:27,732 INFO L480 AbstractCegarLoop]: Abstraction has 34931 states and 106353 transitions. [2018-12-09 00:16:27,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34931 states and 106353 transitions. [2018-12-09 00:16:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:27,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:27,745 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] [2018-12-09 00:16:27,746 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:27,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 984925944, now seen corresponding path program 1 times [2018-12-09 00:16:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:27,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:27,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:27,838 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 00:16:27,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:27,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:16:27,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:16:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:16:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:16:27,839 INFO L87 Difference]: Start difference. First operand 34931 states and 106353 transitions. Second operand 7 states. [2018-12-09 00:16:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:28,154 INFO L93 Difference]: Finished difference Result 30943 states and 89976 transitions. [2018-12-09 00:16:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:16:28,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-09 00:16:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:28,186 INFO L225 Difference]: With dead ends: 30943 [2018-12-09 00:16:28,186 INFO L226 Difference]: Without dead ends: 30943 [2018-12-09 00:16:28,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:16:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2018-12-09 00:16:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 25023. [2018-12-09 00:16:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25023 states. [2018-12-09 00:16:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25023 states to 25023 states and 72808 transitions. [2018-12-09 00:16:28,468 INFO L78 Accepts]: Start accepts. Automaton has 25023 states and 72808 transitions. Word has length 70 [2018-12-09 00:16:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:28,468 INFO L480 AbstractCegarLoop]: Abstraction has 25023 states and 72808 transitions. [2018-12-09 00:16:28,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:16:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 25023 states and 72808 transitions. [2018-12-09 00:16:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:28,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:28,476 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] [2018-12-09 00:16:28,476 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:28,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1872429625, now seen corresponding path program 1 times [2018-12-09 00:16:28,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:28,527 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 00:16:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:28,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:28,528 INFO L87 Difference]: Start difference. First operand 25023 states and 72808 transitions. Second operand 5 states. [2018-12-09 00:16:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:28,557 INFO L93 Difference]: Finished difference Result 7111 states and 17702 transitions. [2018-12-09 00:16:28,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:16:28,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 00:16:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:28,562 INFO L225 Difference]: With dead ends: 7111 [2018-12-09 00:16:28,562 INFO L226 Difference]: Without dead ends: 5778 [2018-12-09 00:16:28,562 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 00:16:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2018-12-09 00:16:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5211. [2018-12-09 00:16:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2018-12-09 00:16:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 12576 transitions. [2018-12-09 00:16:28,601 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 12576 transitions. Word has length 70 [2018-12-09 00:16:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:28,602 INFO L480 AbstractCegarLoop]: Abstraction has 5211 states and 12576 transitions. [2018-12-09 00:16:28,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 12576 transitions. [2018-12-09 00:16:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:16:28,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:28,606 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] [2018-12-09 00:16:28,606 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:28,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:28,606 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-12-09 00:16:28,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:28,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:28,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:28,622 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 00:16:28,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:28,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:16:28,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:28,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:16:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:16:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:16:28,623 INFO L87 Difference]: Start difference. First operand 5211 states and 12576 transitions. Second operand 3 states. [2018-12-09 00:16:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:28,646 INFO L93 Difference]: Finished difference Result 6743 states and 16083 transitions. [2018-12-09 00:16:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:16:28,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-09 00:16:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:28,650 INFO L225 Difference]: With dead ends: 6743 [2018-12-09 00:16:28,651 INFO L226 Difference]: Without dead ends: 6743 [2018-12-09 00:16:28,651 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 00:16:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2018-12-09 00:16:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 5112. [2018-12-09 00:16:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2018-12-09 00:16:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 12061 transitions. [2018-12-09 00:16:28,689 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 12061 transitions. Word has length 70 [2018-12-09 00:16:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:28,689 INFO L480 AbstractCegarLoop]: Abstraction has 5112 states and 12061 transitions. [2018-12-09 00:16:28,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:16:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 12061 transitions. [2018-12-09 00:16:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 00:16:28,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:28,692 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] [2018-12-09 00:16:28,693 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:28,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-12-09 00:16:28,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:28,728 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 00:16:28,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:28,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:28,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:28,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:28,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:28,729 INFO L87 Difference]: Start difference. First operand 5112 states and 12061 transitions. Second operand 5 states. [2018-12-09 00:16:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:28,832 INFO L93 Difference]: Finished difference Result 6146 states and 14511 transitions. [2018-12-09 00:16:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:16:28,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-09 00:16:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:28,836 INFO L225 Difference]: With dead ends: 6146 [2018-12-09 00:16:28,836 INFO L226 Difference]: Without dead ends: 6146 [2018-12-09 00:16:28,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:16:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2018-12-09 00:16:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 5590. [2018-12-09 00:16:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2018-12-09 00:16:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 13219 transitions. [2018-12-09 00:16:28,873 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 13219 transitions. Word has length 76 [2018-12-09 00:16:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:28,874 INFO L480 AbstractCegarLoop]: Abstraction has 5590 states and 13219 transitions. [2018-12-09 00:16:28,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 13219 transitions. [2018-12-09 00:16:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 00:16:28,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:28,877 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] [2018-12-09 00:16:28,877 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:28,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-12-09 00:16:28,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:28,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:28,930 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 00:16:28,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:28,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:16:28,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:28,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:16:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:16:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:16:28,931 INFO L87 Difference]: Start difference. First operand 5590 states and 13219 transitions. Second operand 7 states. [2018-12-09 00:16:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:29,142 INFO L93 Difference]: Finished difference Result 6317 states and 14770 transitions. [2018-12-09 00:16:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:16:29,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 00:16:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:29,146 INFO L225 Difference]: With dead ends: 6317 [2018-12-09 00:16:29,146 INFO L226 Difference]: Without dead ends: 6215 [2018-12-09 00:16:29,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:16:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2018-12-09 00:16:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 5600. [2018-12-09 00:16:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2018-12-09 00:16:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 13149 transitions. [2018-12-09 00:16:29,192 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 13149 transitions. Word has length 76 [2018-12-09 00:16:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:29,193 INFO L480 AbstractCegarLoop]: Abstraction has 5600 states and 13149 transitions. [2018-12-09 00:16:29,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:16:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 13149 transitions. [2018-12-09 00:16:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 00:16:29,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:29,196 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, 1] [2018-12-09 00:16:29,196 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1982349696, now seen corresponding path program 1 times [2018-12-09 00:16:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:29,248 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 00:16:29,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:29,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:16:29,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:29,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:16:29,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:16:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:16:29,249 INFO L87 Difference]: Start difference. First operand 5600 states and 13149 transitions. Second operand 7 states. [2018-12-09 00:16:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:29,572 INFO L93 Difference]: Finished difference Result 6817 states and 16126 transitions. [2018-12-09 00:16:29,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:29,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-09 00:16:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:29,576 INFO L225 Difference]: With dead ends: 6817 [2018-12-09 00:16:29,577 INFO L226 Difference]: Without dead ends: 6817 [2018-12-09 00:16:29,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 00:16:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2018-12-09 00:16:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 5783. [2018-12-09 00:16:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5783 states. [2018-12-09 00:16:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 13733 transitions. [2018-12-09 00:16:29,619 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 13733 transitions. Word has length 97 [2018-12-09 00:16:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:29,619 INFO L480 AbstractCegarLoop]: Abstraction has 5783 states and 13733 transitions. [2018-12-09 00:16:29,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:16:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 13733 transitions. [2018-12-09 00:16:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 00:16:29,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:29,623 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, 1] [2018-12-09 00:16:29,623 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:29,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1424496976, now seen corresponding path program 1 times [2018-12-09 00:16:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:29,656 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 00:16:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:29,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:29,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:29,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:29,657 INFO L87 Difference]: Start difference. First operand 5783 states and 13733 transitions. Second operand 4 states. [2018-12-09 00:16:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:29,719 INFO L93 Difference]: Finished difference Result 6884 states and 16093 transitions. [2018-12-09 00:16:29,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:16:29,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 00:16:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:29,723 INFO L225 Difference]: With dead ends: 6884 [2018-12-09 00:16:29,724 INFO L226 Difference]: Without dead ends: 6884 [2018-12-09 00:16:29,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 00:16:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2018-12-09 00:16:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 6235. [2018-12-09 00:16:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6235 states. [2018-12-09 00:16:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6235 states to 6235 states and 14671 transitions. [2018-12-09 00:16:29,768 INFO L78 Accepts]: Start accepts. Automaton has 6235 states and 14671 transitions. Word has length 97 [2018-12-09 00:16:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:29,768 INFO L480 AbstractCegarLoop]: Abstraction has 6235 states and 14671 transitions. [2018-12-09 00:16:29,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6235 states and 14671 transitions. [2018-12-09 00:16:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:29,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:29,772 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, 1, 1, 1] [2018-12-09 00:16:29,772 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:29,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1324645014, now seen corresponding path program 1 times [2018-12-09 00:16:29,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:29,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:29,810 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 00:16:29,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:29,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:29,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:29,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:29,811 INFO L87 Difference]: Start difference. First operand 6235 states and 14671 transitions. Second operand 5 states. [2018-12-09 00:16:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:29,866 INFO L93 Difference]: Finished difference Result 6821 states and 15986 transitions. [2018-12-09 00:16:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:29,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 00:16:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:29,870 INFO L225 Difference]: With dead ends: 6821 [2018-12-09 00:16:29,871 INFO L226 Difference]: Without dead ends: 6821 [2018-12-09 00:16:29,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:16:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-09 00:16:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 5265. [2018-12-09 00:16:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5265 states. [2018-12-09 00:16:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 12335 transitions. [2018-12-09 00:16:29,909 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 12335 transitions. Word has length 99 [2018-12-09 00:16:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:29,909 INFO L480 AbstractCegarLoop]: Abstraction has 5265 states and 12335 transitions. [2018-12-09 00:16:29,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 12335 transitions. [2018-12-09 00:16:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:29,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:29,912 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, 1, 1, 1] [2018-12-09 00:16:29,913 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:29,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1335961141, now seen corresponding path program 1 times [2018-12-09 00:16:29,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:29,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:29,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:29,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:29,938 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 00:16:29,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:29,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:16:29,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:29,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:16:29,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:16:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:16:29,939 INFO L87 Difference]: Start difference. First operand 5265 states and 12335 transitions. Second operand 4 states. [2018-12-09 00:16:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:30,069 INFO L93 Difference]: Finished difference Result 6800 states and 15876 transitions. [2018-12-09 00:16:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:16:30,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-09 00:16:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:30,074 INFO L225 Difference]: With dead ends: 6800 [2018-12-09 00:16:30,074 INFO L226 Difference]: Without dead ends: 6739 [2018-12-09 00:16:30,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2018-12-09 00:16:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 6337. [2018-12-09 00:16:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6337 states. [2018-12-09 00:16:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 14856 transitions. [2018-12-09 00:16:30,119 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 14856 transitions. Word has length 99 [2018-12-09 00:16:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:30,119 INFO L480 AbstractCegarLoop]: Abstraction has 6337 states and 14856 transitions. [2018-12-09 00:16:30,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:16:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 14856 transitions. [2018-12-09 00:16:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:30,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:30,123 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, 1, 1, 1] [2018-12-09 00:16:30,124 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:30,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:30,124 INFO L82 PathProgramCache]: Analyzing trace with hash -741248202, now seen corresponding path program 1 times [2018-12-09 00:16:30,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:30,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:30,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:30,199 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 00:16:30,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:30,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:16:30,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:30,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:16:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:16:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:16:30,200 INFO L87 Difference]: Start difference. First operand 6337 states and 14856 transitions. Second operand 7 states. [2018-12-09 00:16:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:30,303 INFO L93 Difference]: Finished difference Result 8083 states and 18867 transitions. [2018-12-09 00:16:30,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:30,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 00:16:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:30,308 INFO L225 Difference]: With dead ends: 8083 [2018-12-09 00:16:30,309 INFO L226 Difference]: Without dead ends: 8083 [2018-12-09 00:16:30,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:16:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8083 states. [2018-12-09 00:16:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8083 to 6105. [2018-12-09 00:16:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6105 states. [2018-12-09 00:16:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6105 states to 6105 states and 14166 transitions. [2018-12-09 00:16:30,358 INFO L78 Accepts]: Start accepts. Automaton has 6105 states and 14166 transitions. Word has length 99 [2018-12-09 00:16:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:30,359 INFO L480 AbstractCegarLoop]: Abstraction has 6105 states and 14166 transitions. [2018-12-09 00:16:30,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:16:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6105 states and 14166 transitions. [2018-12-09 00:16:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:30,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:30,364 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, 1, 1, 1] [2018-12-09 00:16:30,364 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:30,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2018-12-09 00:16:30,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:30,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:30,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:30,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:30,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:30,423 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 00:16:30,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:30,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:30,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:30,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:30,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:30,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:30,424 INFO L87 Difference]: Start difference. First operand 6105 states and 14166 transitions. Second operand 5 states. [2018-12-09 00:16:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:30,450 INFO L93 Difference]: Finished difference Result 6105 states and 14150 transitions. [2018-12-09 00:16:30,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:16:30,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 00:16:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:30,455 INFO L225 Difference]: With dead ends: 6105 [2018-12-09 00:16:30,455 INFO L226 Difference]: Without dead ends: 6105 [2018-12-09 00:16:30,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:16:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2018-12-09 00:16:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5757. [2018-12-09 00:16:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2018-12-09 00:16:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 13316 transitions. [2018-12-09 00:16:30,495 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 13316 transitions. Word has length 99 [2018-12-09 00:16:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:30,495 INFO L480 AbstractCegarLoop]: Abstraction has 5757 states and 13316 transitions. [2018-12-09 00:16:30,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 13316 transitions. [2018-12-09 00:16:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:30,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:30,500 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, 1, 1, 1] [2018-12-09 00:16:30,500 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:30,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2018-12-09 00:16:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:30,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:30,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:30,617 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 00:16:30,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:30,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:16:30,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:30,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:16:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:16:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:16:30,618 INFO L87 Difference]: Start difference. First operand 5757 states and 13316 transitions. Second operand 10 states. [2018-12-09 00:16:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:31,202 INFO L93 Difference]: Finished difference Result 8664 states and 19989 transitions. [2018-12-09 00:16:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:16:31,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-09 00:16:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:31,208 INFO L225 Difference]: With dead ends: 8664 [2018-12-09 00:16:31,208 INFO L226 Difference]: Without dead ends: 6420 [2018-12-09 00:16:31,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:16:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2018-12-09 00:16:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5890. [2018-12-09 00:16:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5890 states. [2018-12-09 00:16:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 13589 transitions. [2018-12-09 00:16:31,251 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 13589 transitions. Word has length 99 [2018-12-09 00:16:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:31,251 INFO L480 AbstractCegarLoop]: Abstraction has 5890 states and 13589 transitions. [2018-12-09 00:16:31,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:16:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 13589 transitions. [2018-12-09 00:16:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:31,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:31,255 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, 1, 1, 1] [2018-12-09 00:16:31,255 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:31,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash 571332279, now seen corresponding path program 1 times [2018-12-09 00:16:31,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:31,328 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 00:16:31,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:31,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:16:31,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:31,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:16:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:16:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:16:31,330 INFO L87 Difference]: Start difference. First operand 5890 states and 13589 transitions. Second operand 6 states. [2018-12-09 00:16:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:31,428 INFO L93 Difference]: Finished difference Result 7234 states and 16172 transitions. [2018-12-09 00:16:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:16:31,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 00:16:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:31,434 INFO L225 Difference]: With dead ends: 7234 [2018-12-09 00:16:31,434 INFO L226 Difference]: Without dead ends: 7203 [2018-12-09 00:16:31,434 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 00:16:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7203 states. [2018-12-09 00:16:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7203 to 5897. [2018-12-09 00:16:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-09 00:16:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13285 transitions. [2018-12-09 00:16:31,481 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13285 transitions. Word has length 99 [2018-12-09 00:16:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:31,482 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13285 transitions. [2018-12-09 00:16:31,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:16:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13285 transitions. [2018-12-09 00:16:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:31,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:31,486 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, 1, 1, 1] [2018-12-09 00:16:31,486 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:31,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:31,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1679511564, now seen corresponding path program 1 times [2018-12-09 00:16:31,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:31,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:31,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:31,521 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 00:16:31,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:31,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:16:31,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:31,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:16:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:16:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:16:31,522 INFO L87 Difference]: Start difference. First operand 5897 states and 13285 transitions. Second operand 5 states. [2018-12-09 00:16:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:31,671 INFO L93 Difference]: Finished difference Result 6847 states and 15318 transitions. [2018-12-09 00:16:31,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:16:31,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 00:16:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:31,678 INFO L225 Difference]: With dead ends: 6847 [2018-12-09 00:16:31,678 INFO L226 Difference]: Without dead ends: 6781 [2018-12-09 00:16:31,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 00:16:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2018-12-09 00:16:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 5524. [2018-12-09 00:16:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5524 states. [2018-12-09 00:16:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 12519 transitions. [2018-12-09 00:16:31,742 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 12519 transitions. Word has length 99 [2018-12-09 00:16:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:31,742 INFO L480 AbstractCegarLoop]: Abstraction has 5524 states and 12519 transitions. [2018-12-09 00:16:31,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:16:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 12519 transitions. [2018-12-09 00:16:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:31,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:31,746 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, 1, 1, 1] [2018-12-09 00:16:31,746 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:31,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1922354035, now seen corresponding path program 2 times [2018-12-09 00:16:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:16:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:31,804 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 00:16:31,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:31,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:16:31,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:31,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:16:31,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:16:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:16:31,805 INFO L87 Difference]: Start difference. First operand 5524 states and 12519 transitions. Second operand 6 states. [2018-12-09 00:16:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:31,913 INFO L93 Difference]: Finished difference Result 5976 states and 13438 transitions. [2018-12-09 00:16:31,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:16:31,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 00:16:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:31,917 INFO L225 Difference]: With dead ends: 5976 [2018-12-09 00:16:31,917 INFO L226 Difference]: Without dead ends: 5976 [2018-12-09 00:16:31,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:16:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2018-12-09 00:16:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5689. [2018-12-09 00:16:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2018-12-09 00:16:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12814 transitions. [2018-12-09 00:16:31,971 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12814 transitions. Word has length 99 [2018-12-09 00:16:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:31,971 INFO L480 AbstractCegarLoop]: Abstraction has 5689 states and 12814 transitions. [2018-12-09 00:16:31,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:16:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12814 transitions. [2018-12-09 00:16:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:31,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:31,975 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, 1, 1, 1] [2018-12-09 00:16:31,975 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:31,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash 122635640, now seen corresponding path program 2 times [2018-12-09 00:16:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:16:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:31,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:32,042 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 00:16:32,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:32,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:16:32,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:32,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:16:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:16:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:16:32,043 INFO L87 Difference]: Start difference. First operand 5689 states and 12814 transitions. Second operand 9 states. [2018-12-09 00:16:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:32,168 INFO L93 Difference]: Finished difference Result 8754 states and 19756 transitions. [2018-12-09 00:16:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:16:32,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-09 00:16:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:32,170 INFO L225 Difference]: With dead ends: 8754 [2018-12-09 00:16:32,171 INFO L226 Difference]: Without dead ends: 3276 [2018-12-09 00:16:32,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:16:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2018-12-09 00:16:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2018-12-09 00:16:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2018-12-09 00:16:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 7363 transitions. [2018-12-09 00:16:32,201 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 7363 transitions. Word has length 99 [2018-12-09 00:16:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:32,201 INFO L480 AbstractCegarLoop]: Abstraction has 3276 states and 7363 transitions. [2018-12-09 00:16:32,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:16:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 7363 transitions. [2018-12-09 00:16:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:32,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:32,204 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, 1, 1, 1] [2018-12-09 00:16:32,205 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:32,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1712473986, now seen corresponding path program 3 times [2018-12-09 00:16:32,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:32,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:16:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:32,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:16:32,329 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 00:16:32,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:16:32,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 00:16:32,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:16:32,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:16:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:16:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:16:32,330 INFO L87 Difference]: Start difference. First operand 3276 states and 7363 transitions. Second operand 11 states. [2018-12-09 00:16:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:16:32,782 INFO L93 Difference]: Finished difference Result 6829 states and 15388 transitions. [2018-12-09 00:16:32,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:16:32,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-09 00:16:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:16:32,785 INFO L225 Difference]: With dead ends: 6829 [2018-12-09 00:16:32,785 INFO L226 Difference]: Without dead ends: 4448 [2018-12-09 00:16:32,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:16:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2018-12-09 00:16:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 3307. [2018-12-09 00:16:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3307 states. [2018-12-09 00:16:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 7379 transitions. [2018-12-09 00:16:32,810 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 7379 transitions. Word has length 99 [2018-12-09 00:16:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:16:32,810 INFO L480 AbstractCegarLoop]: Abstraction has 3307 states and 7379 transitions. [2018-12-09 00:16:32,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:16:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 7379 transitions. [2018-12-09 00:16:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 00:16:32,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:16:32,812 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, 1, 1, 1] [2018-12-09 00:16:32,812 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:16:32,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:16:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash -109781726, now seen corresponding path program 4 times [2018-12-09 00:16:32,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:16:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:32,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:16:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:16:32,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:16:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:16:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:16:32,873 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:16:32,975 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 00:16:32,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:16:32 BasicIcfg [2018-12-09 00:16:32,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:16:32,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:16:32,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:16:32,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:16:32,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:16:18" (3/4) ... [2018-12-09 00:16:32,978 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:16:33,054 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_14ec13de-205b-4e73-ac63-77fa6a37d745/bin-2019/utaipan/witness.graphml [2018-12-09 00:16:33,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:16:33,054 INFO L168 Benchmark]: Toolchain (without parser) took 15509.67 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 948.1 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 392.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:16:33,055 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:16:33,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:16:33,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.50 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:16:33,056 INFO L168 Benchmark]: Boogie Preprocessor took 20.06 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 00:16:33,056 INFO L168 Benchmark]: RCFGBuilder took 325.92 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:16:33,056 INFO L168 Benchmark]: TraceAbstraction took 14728.57 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 336.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:16:33,056 INFO L168 Benchmark]: Witness Printer took 77.99 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:16:33,057 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.50 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.06 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 325.92 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14728.57 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 336.3 MB. Max. memory is 11.5 GB. * Witness Printer took 77.99 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t843; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t844; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 14.6s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8146 SDtfs, 8541 SDslu, 18317 SDs, 0 SdLazy, 6698 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 71 SyntacticMatches, 29 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34931occurred in iteration=13, 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: 4.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 67585 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2433 NumberOfCodeBlocks, 2433 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2304 ConstructedInterpolants, 0 QuantifiedInterpolants, 535727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...