./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b55418eaa2ec3212dd6ecf5ad533b8a46d5e088 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:31:30,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:31:30,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:31:30,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:31:30,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:31:30,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:31:30,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:31:30,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:31:30,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:31:30,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:31:30,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:31:30,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:31:30,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:31:30,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:31:30,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:31:30,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:31:30,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:31:30,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:31:30,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:31:30,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:31:30,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:31:30,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:31:30,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:31:30,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:31:30,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:31:30,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:31:30,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:31:30,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:31:30,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:31:30,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:31:30,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:31:30,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:31:30,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:31:30,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:31:30,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:31:30,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:31:30,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:31:30,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:31:30,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:31:30,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:31:30,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:31:30,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:31:30,153 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:31:30,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:31:30,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:31:30,154 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:31:30,154 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:31:30,154 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:31:30,154 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:31:30,155 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:31:30,155 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:31:30,155 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:31:30,155 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:31:30,155 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:31:30,155 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:31:30,156 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:31:30,156 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:31:30,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:31:30,156 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:31:30,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:31:30,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:31:30,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:31:30,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:31:30,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:31:30,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:31:30,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:31:30,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:31:30,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:31:30,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:31:30,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:31:30,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:31:30,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:31:30,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:31:30,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:31:30,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:31:30,160 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:31:30,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:31:30,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:31:30,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:31:30,160 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b55418eaa2ec3212dd6ecf5ad533b8a46d5e088 [2019-11-26 02:31:30,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:31:30,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:31:30,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:31:30,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:31:30,354 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:31:30,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-11-26 02:31:30,415 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/data/12ee96f45/f274cdab4d044b9f8e674c80b88bc96c/FLAG153c7f3cb [2019-11-26 02:31:30,867 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:31:30,867 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-11-26 02:31:30,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/data/12ee96f45/f274cdab4d044b9f8e674c80b88bc96c/FLAG153c7f3cb [2019-11-26 02:31:30,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/data/12ee96f45/f274cdab4d044b9f8e674c80b88bc96c [2019-11-26 02:31:30,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:31:30,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:31:30,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:31:30,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:31:30,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:31:30,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:31:30" (1/1) ... [2019-11-26 02:31:30,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e592e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:30, skipping insertion in model container [2019-11-26 02:31:30,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:31:30" (1/1) ... [2019-11-26 02:31:30,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:31:30,999 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:31:31,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:31:31,438 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:31:31,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:31:31,552 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:31:31,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31 WrapperNode [2019-11-26 02:31:31,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:31:31,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:31:31,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:31:31,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:31:31,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:31:31,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:31:31,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:31:31,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:31:31,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... [2019-11-26 02:31:31,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:31:31,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:31:31,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:31:31,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:31:31,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:31:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:31:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-26 02:31:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:31:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:31:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-26 02:31:31,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-26 02:31:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-26 02:31:31,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-26 02:31:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-26 02:31:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:31:31,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:31:31,783 WARN L202 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-26 02:31:32,454 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:31:32,454 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-26 02:31:32,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:31:32 BoogieIcfgContainer [2019-11-26 02:31:32,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:31:32,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:31:32,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:31:32,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:31:32,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:31:30" (1/3) ... [2019-11-26 02:31:32,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f872ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:31:32, skipping insertion in model container [2019-11-26 02:31:32,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:31" (2/3) ... [2019-11-26 02:31:32,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f872ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:31:32, skipping insertion in model container [2019-11-26 02:31:32,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:31:32" (3/3) ... [2019-11-26 02:31:32,462 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-11-26 02:31:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,516 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,516 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,555 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:31:32,621 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-26 02:31:32,621 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:31:32,629 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-26 02:31:32,638 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-26 02:31:32,658 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:31:32,658 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:31:32,658 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:31:32,658 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:31:32,658 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:31:32,658 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:31:32,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:31:32,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:31:32,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 274 places, 350 transitions [2019-11-26 02:31:34,346 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-11-26 02:31:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-11-26 02:31:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:31:34,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:34,359 INFO L410 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] [2019-11-26 02:31:34,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash 671764825, now seen corresponding path program 1 times [2019-11-26 02:31:34,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:34,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953778687] [2019-11-26 02:31:34,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:34,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953778687] [2019-11-26 02:31:34,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:34,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:34,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443576414] [2019-11-26 02:31:34,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:34,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:34,618 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-11-26 02:31:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:35,438 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-11-26 02:31:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:31:35,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-26 02:31:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:35,659 INFO L225 Difference]: With dead ends: 26616 [2019-11-26 02:31:35,660 INFO L226 Difference]: Without dead ends: 20360 [2019-11-26 02:31:35,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-11-26 02:31:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-11-26 02:31:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-26 02:31:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-11-26 02:31:36,535 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-11-26 02:31:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:36,536 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-11-26 02:31:36,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-11-26 02:31:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:31:36,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:36,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:36,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1255000323, now seen corresponding path program 1 times [2019-11-26 02:31:36,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:36,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657798410] [2019-11-26 02:31:36,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:36,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657798410] [2019-11-26 02:31:36,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:36,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:31:36,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870652495] [2019-11-26 02:31:36,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:31:36,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:31:36,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:36,662 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-11-26 02:31:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:37,768 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-11-26 02:31:37,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:31:37,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-26 02:31:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:37,894 INFO L225 Difference]: With dead ends: 31838 [2019-11-26 02:31:37,894 INFO L226 Difference]: Without dead ends: 31286 [2019-11-26 02:31:37,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-11-26 02:31:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-11-26 02:31:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-11-26 02:31:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-11-26 02:31:38,753 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-11-26 02:31:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:38,754 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-11-26 02:31:38,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:31:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-11-26 02:31:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:31:38,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:38,760 INFO L410 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] [2019-11-26 02:31:38,760 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1808626490, now seen corresponding path program 1 times [2019-11-26 02:31:38,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:38,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540846946] [2019-11-26 02:31:38,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:39,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540846946] [2019-11-26 02:31:39,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:39,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:31:39,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233497598] [2019-11-26 02:31:39,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:31:39,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:31:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:39,220 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-11-26 02:31:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:39,697 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-11-26 02:31:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:31:39,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-26 02:31:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:39,899 INFO L225 Difference]: With dead ends: 38696 [2019-11-26 02:31:39,899 INFO L226 Difference]: Without dead ends: 38248 [2019-11-26 02:31:39,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-11-26 02:31:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-11-26 02:31:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-11-26 02:31:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-11-26 02:31:40,874 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-11-26 02:31:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:40,877 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-11-26 02:31:40,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:31:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-11-26 02:31:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:31:40,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:40,889 INFO L410 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] [2019-11-26 02:31:40,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash -614004960, now seen corresponding path program 1 times [2019-11-26 02:31:40,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:40,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156253490] [2019-11-26 02:31:40,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:40,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156253490] [2019-11-26 02:31:40,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:40,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:31:40,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258844574] [2019-11-26 02:31:40,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:40,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:40,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:40,960 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-11-26 02:31:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:41,581 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-11-26 02:31:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:41,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-26 02:31:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:41,653 INFO L225 Difference]: With dead ends: 42412 [2019-11-26 02:31:41,653 INFO L226 Difference]: Without dead ends: 42412 [2019-11-26 02:31:41,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-11-26 02:31:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-11-26 02:31:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-11-26 02:31:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-11-26 02:31:42,393 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-11-26 02:31:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:42,393 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-11-26 02:31:42,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-11-26 02:31:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:31:42,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:42,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:42,410 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 802194191, now seen corresponding path program 1 times [2019-11-26 02:31:42,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:42,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62992071] [2019-11-26 02:31:42,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:42,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62992071] [2019-11-26 02:31:42,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:42,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:42,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85827411] [2019-11-26 02:31:42,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:42,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:42,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:42,494 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-11-26 02:31:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:43,539 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-11-26 02:31:43,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 02:31:43,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-26 02:31:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:43,613 INFO L225 Difference]: With dead ends: 48756 [2019-11-26 02:31:43,613 INFO L226 Difference]: Without dead ends: 48236 [2019-11-26 02:31:43,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:31:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-11-26 02:31:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-11-26 02:31:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-11-26 02:31:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-11-26 02:31:44,382 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-11-26 02:31:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:44,383 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-11-26 02:31:44,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-11-26 02:31:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:31:44,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:44,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:44,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1693240906, now seen corresponding path program 1 times [2019-11-26 02:31:44,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:44,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743738246] [2019-11-26 02:31:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:44,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743738246] [2019-11-26 02:31:44,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:44,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:31:44,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787654159] [2019-11-26 02:31:44,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:44,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:44,442 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 3 states. [2019-11-26 02:31:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:44,730 INFO L93 Difference]: Finished difference Result 42347 states and 153425 transitions. [2019-11-26 02:31:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:44,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-26 02:31:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:44,804 INFO L225 Difference]: With dead ends: 42347 [2019-11-26 02:31:44,804 INFO L226 Difference]: Without dead ends: 42347 [2019-11-26 02:31:44,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42347 states. [2019-11-26 02:31:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42347 to 40235. [2019-11-26 02:31:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40235 states. [2019-11-26 02:31:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40235 states to 40235 states and 145783 transitions. [2019-11-26 02:31:46,124 INFO L78 Accepts]: Start accepts. Automaton has 40235 states and 145783 transitions. Word has length 54 [2019-11-26 02:31:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:46,125 INFO L462 AbstractCegarLoop]: Abstraction has 40235 states and 145783 transitions. [2019-11-26 02:31:46,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 40235 states and 145783 transitions. [2019-11-26 02:31:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:31:46,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:46,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:46,135 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:46,136 INFO L82 PathProgramCache]: Analyzing trace with hash 179189450, now seen corresponding path program 1 times [2019-11-26 02:31:46,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:46,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022180947] [2019-11-26 02:31:46,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:46,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022180947] [2019-11-26 02:31:46,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:46,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:46,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600617700] [2019-11-26 02:31:46,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:46,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:46,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:46,291 INFO L87 Difference]: Start difference. First operand 40235 states and 145783 transitions. Second operand 6 states. [2019-11-26 02:31:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:47,037 INFO L93 Difference]: Finished difference Result 54445 states and 194725 transitions. [2019-11-26 02:31:47,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:31:47,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-26 02:31:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:47,140 INFO L225 Difference]: With dead ends: 54445 [2019-11-26 02:31:47,140 INFO L226 Difference]: Without dead ends: 53469 [2019-11-26 02:31:47,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-11-26 02:31:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 48782. [2019-11-26 02:31:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-11-26 02:31:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-11-26 02:31:47,945 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-11-26 02:31:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:47,945 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-11-26 02:31:47,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-11-26 02:31:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:31:47,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:47,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:47,957 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1617761909, now seen corresponding path program 1 times [2019-11-26 02:31:47,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:47,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041510365] [2019-11-26 02:31:47,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:48,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041510365] [2019-11-26 02:31:48,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:48,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:31:48,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144721630] [2019-11-26 02:31:48,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:31:48,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:31:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:31:48,049 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-11-26 02:31:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:49,037 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-11-26 02:31:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:31:49,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-26 02:31:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:49,155 INFO L225 Difference]: With dead ends: 70897 [2019-11-26 02:31:49,155 INFO L226 Difference]: Without dead ends: 70897 [2019-11-26 02:31:49,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:31:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-11-26 02:31:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-11-26 02:31:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-11-26 02:31:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-11-26 02:31:50,712 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-11-26 02:31:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:50,713 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-11-26 02:31:50,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:31:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-11-26 02:31:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:31:50,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:50,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:50,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -730258228, now seen corresponding path program 1 times [2019-11-26 02:31:50,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:50,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248504061] [2019-11-26 02:31:50,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:50,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248504061] [2019-11-26 02:31:50,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:50,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:31:50,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890142151] [2019-11-26 02:31:50,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:50,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:50,785 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-11-26 02:31:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:50,941 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-11-26 02:31:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:50,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-26 02:31:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:51,012 INFO L225 Difference]: With dead ends: 43856 [2019-11-26 02:31:51,012 INFO L226 Difference]: Without dead ends: 43352 [2019-11-26 02:31:51,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-11-26 02:31:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-11-26 02:31:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-11-26 02:31:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-11-26 02:31:51,651 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-11-26 02:31:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:51,652 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-11-26 02:31:51,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-11-26 02:31:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 02:31:51,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:51,661 INFO L410 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] [2019-11-26 02:31:51,661 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash -437301600, now seen corresponding path program 1 times [2019-11-26 02:31:51,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:51,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610315088] [2019-11-26 02:31:51,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:51,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610315088] [2019-11-26 02:31:51,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:51,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:51,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112015997] [2019-11-26 02:31:51,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:51,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:51,756 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-11-26 02:31:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:52,415 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-11-26 02:31:52,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:31:52,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-26 02:31:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:52,509 INFO L225 Difference]: With dead ends: 54549 [2019-11-26 02:31:52,509 INFO L226 Difference]: Without dead ends: 54549 [2019-11-26 02:31:52,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-11-26 02:31:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-11-26 02:31:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-11-26 02:31:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-11-26 02:31:53,797 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-11-26 02:31:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:53,797 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-11-26 02:31:53,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-11-26 02:31:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 02:31:53,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:53,806 INFO L410 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] [2019-11-26 02:31:53,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash 450202081, now seen corresponding path program 1 times [2019-11-26 02:31:53,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:53,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310440776] [2019-11-26 02:31:53,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:53,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310440776] [2019-11-26 02:31:53,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:53,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:53,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006521530] [2019-11-26 02:31:53,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:53,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:53,894 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-11-26 02:31:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:53,932 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-11-26 02:31:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:31:53,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-26 02:31:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:53,940 INFO L225 Difference]: With dead ends: 8163 [2019-11-26 02:31:53,941 INFO L226 Difference]: Without dead ends: 6754 [2019-11-26 02:31:53,941 INFO L630 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 [2019-11-26 02:31:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-11-26 02:31:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-11-26 02:31:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-11-26 02:31:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-11-26 02:31:54,010 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-11-26 02:31:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:54,010 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-11-26 02:31:54,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-11-26 02:31:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:31:54,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:54,013 INFO L410 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] [2019-11-26 02:31:54,013 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1994982539, now seen corresponding path program 1 times [2019-11-26 02:31:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:54,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58841280] [2019-11-26 02:31:54,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:54,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58841280] [2019-11-26 02:31:54,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:54,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:54,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510325422] [2019-11-26 02:31:54,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:54,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:54,065 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 4 states. [2019-11-26 02:31:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:54,196 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-11-26 02:31:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:31:54,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:31:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:54,208 INFO L225 Difference]: With dead ends: 7891 [2019-11-26 02:31:54,208 INFO L226 Difference]: Without dead ends: 7891 [2019-11-26 02:31:54,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-11-26 02:31:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-11-26 02:31:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-11-26 02:31:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-11-26 02:31:54,325 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-11-26 02:31:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:54,325 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-11-26 02:31:54,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-11-26 02:31:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:31:54,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:54,330 INFO L410 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] [2019-11-26 02:31:54,331 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash -557174422, now seen corresponding path program 1 times [2019-11-26 02:31:54,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:54,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94410087] [2019-11-26 02:31:54,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:54,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94410087] [2019-11-26 02:31:54,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:54,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:54,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844614793] [2019-11-26 02:31:54,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:54,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:54,431 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 6 states. [2019-11-26 02:31:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:54,746 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-11-26 02:31:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:31:54,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-26 02:31:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:54,760 INFO L225 Difference]: With dead ends: 9268 [2019-11-26 02:31:54,760 INFO L226 Difference]: Without dead ends: 9220 [2019-11-26 02:31:54,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:31:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-11-26 02:31:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-11-26 02:31:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-11-26 02:31:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-11-26 02:31:54,887 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-11-26 02:31:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:54,887 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-11-26 02:31:54,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-11-26 02:31:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:54,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:54,893 INFO L410 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] [2019-11-26 02:31:54,893 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash 790791200, now seen corresponding path program 1 times [2019-11-26 02:31:54,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:54,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20218953] [2019-11-26 02:31:54,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:54,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20218953] [2019-11-26 02:31:54,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:54,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:54,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218032493] [2019-11-26 02:31:54,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:54,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:54,962 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-11-26 02:31:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:55,200 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-11-26 02:31:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:31:55,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-26 02:31:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:55,211 INFO L225 Difference]: With dead ends: 10665 [2019-11-26 02:31:55,211 INFO L226 Difference]: Without dead ends: 10665 [2019-11-26 02:31:55,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-11-26 02:31:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-11-26 02:31:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-11-26 02:31:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-11-26 02:31:55,311 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-11-26 02:31:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:55,312 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-11-26 02:31:55,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-11-26 02:31:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:55,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:55,318 INFO L410 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] [2019-11-26 02:31:55,318 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:55,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2035555681, now seen corresponding path program 1 times [2019-11-26 02:31:55,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:55,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179904539] [2019-11-26 02:31:55,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:55,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179904539] [2019-11-26 02:31:55,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:55,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076299857] [2019-11-26 02:31:55,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:55,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:55,445 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-11-26 02:31:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:55,847 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-11-26 02:31:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:31:55,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-26 02:31:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:55,858 INFO L225 Difference]: With dead ends: 10385 [2019-11-26 02:31:55,859 INFO L226 Difference]: Without dead ends: 10385 [2019-11-26 02:31:55,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-11-26 02:31:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-11-26 02:31:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-11-26 02:31:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-11-26 02:31:55,969 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-11-26 02:31:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:55,970 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-11-26 02:31:55,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-11-26 02:31:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:55,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:55,977 INFO L410 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] [2019-11-26 02:31:55,977 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash -41653662, now seen corresponding path program 1 times [2019-11-26 02:31:55,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:55,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254126290] [2019-11-26 02:31:55,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:56,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254126290] [2019-11-26 02:31:56,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:56,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:56,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39133964] [2019-11-26 02:31:56,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:56,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:56,082 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-11-26 02:31:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:56,413 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-11-26 02:31:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:31:56,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-26 02:31:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:56,424 INFO L225 Difference]: With dead ends: 11999 [2019-11-26 02:31:56,425 INFO L226 Difference]: Without dead ends: 11999 [2019-11-26 02:31:56,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:31:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-11-26 02:31:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-11-26 02:31:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-11-26 02:31:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-11-26 02:31:56,536 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-11-26 02:31:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:56,536 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-11-26 02:31:56,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-11-26 02:31:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:56,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:56,542 INFO L410 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] [2019-11-26 02:31:56,542 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 169697251, now seen corresponding path program 1 times [2019-11-26 02:31:56,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:56,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211763037] [2019-11-26 02:31:56,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:56,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211763037] [2019-11-26 02:31:56,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:56,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:31:56,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537680028] [2019-11-26 02:31:56,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:31:56,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:31:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:56,606 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-11-26 02:31:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:56,850 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-11-26 02:31:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:31:56,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-26 02:31:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:56,863 INFO L225 Difference]: With dead ends: 12576 [2019-11-26 02:31:56,863 INFO L226 Difference]: Without dead ends: 12576 [2019-11-26 02:31:56,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:31:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-11-26 02:31:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-11-26 02:31:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-11-26 02:31:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-11-26 02:31:56,985 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-11-26 02:31:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:56,985 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-11-26 02:31:56,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:31:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-11-26 02:31:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:56,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:56,991 INFO L410 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] [2019-11-26 02:31:56,991 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash -340836926, now seen corresponding path program 1 times [2019-11-26 02:31:56,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:56,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029790248] [2019-11-26 02:31:56,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:57,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029790248] [2019-11-26 02:31:57,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:57,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:57,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611664647] [2019-11-26 02:31:57,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:57,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:57,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:57,073 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-11-26 02:31:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:57,635 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-11-26 02:31:57,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:31:57,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-26 02:31:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:57,654 INFO L225 Difference]: With dead ends: 17070 [2019-11-26 02:31:57,654 INFO L226 Difference]: Without dead ends: 17070 [2019-11-26 02:31:57,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-11-26 02:31:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-11-26 02:31:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-11-26 02:31:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-11-26 02:31:57,901 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-11-26 02:31:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:57,901 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-11-26 02:31:57,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-11-26 02:31:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:57,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:57,911 INFO L410 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] [2019-11-26 02:31:57,912 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 546666755, now seen corresponding path program 1 times [2019-11-26 02:31:57,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:57,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167741697] [2019-11-26 02:31:57,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:57,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167741697] [2019-11-26 02:31:57,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:57,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:57,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771074611] [2019-11-26 02:31:57,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:57,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:57,986 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-11-26 02:31:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:58,336 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-11-26 02:31:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:31:58,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-26 02:31:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:58,352 INFO L225 Difference]: With dead ends: 14460 [2019-11-26 02:31:58,352 INFO L226 Difference]: Without dead ends: 13986 [2019-11-26 02:31:58,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-11-26 02:31:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-11-26 02:31:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-11-26 02:31:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-11-26 02:31:58,502 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-11-26 02:31:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:58,502 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-11-26 02:31:58,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-11-26 02:31:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:58,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:58,509 INFO L410 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] [2019-11-26 02:31:58,509 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2137788285, now seen corresponding path program 1 times [2019-11-26 02:31:58,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:58,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552685962] [2019-11-26 02:31:58,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:58,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552685962] [2019-11-26 02:31:58,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:58,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 02:31:58,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801056999] [2019-11-26 02:31:58,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:31:58,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:31:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:31:58,637 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-11-26 02:31:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:59,220 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-11-26 02:31:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:31:59,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-26 02:31:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:59,250 INFO L225 Difference]: With dead ends: 19154 [2019-11-26 02:31:59,250 INFO L226 Difference]: Without dead ends: 19154 [2019-11-26 02:31:59,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:31:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-11-26 02:31:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-11-26 02:31:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-11-26 02:31:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-11-26 02:31:59,504 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-11-26 02:31:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:59,504 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-11-26 02:31:59,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:31:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-11-26 02:31:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:31:59,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:59,515 INFO L410 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] [2019-11-26 02:31:59,515 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1250284604, now seen corresponding path program 1 times [2019-11-26 02:31:59,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:59,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987165020] [2019-11-26 02:31:59,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:59,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987165020] [2019-11-26 02:31:59,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:59,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:31:59,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146660058] [2019-11-26 02:31:59,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:31:59,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:59,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:31:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:59,612 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-11-26 02:31:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:59,659 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-11-26 02:31:59,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:31:59,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-26 02:31:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:59,664 INFO L225 Difference]: With dead ends: 4904 [2019-11-26 02:31:59,664 INFO L226 Difference]: Without dead ends: 4032 [2019-11-26 02:31:59,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:31:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-11-26 02:31:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-11-26 02:31:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-11-26 02:31:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-11-26 02:31:59,708 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-11-26 02:31:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:59,708 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-11-26 02:31:59,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:31:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-11-26 02:31:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:31:59,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:59,713 INFO L410 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] [2019-11-26 02:31:59,714 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -303128757, now seen corresponding path program 1 times [2019-11-26 02:31:59,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:59,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302900236] [2019-11-26 02:31:59,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:59,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302900236] [2019-11-26 02:31:59,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:59,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:59,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54107204] [2019-11-26 02:31:59,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:59,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:59,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:59,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:59,772 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-11-26 02:31:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:59,805 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-11-26 02:31:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:31:59,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-26 02:31:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:59,809 INFO L225 Difference]: With dead ends: 3364 [2019-11-26 02:31:59,809 INFO L226 Difference]: Without dead ends: 3364 [2019-11-26 02:31:59,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:31:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-11-26 02:31:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-11-26 02:31:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-11-26 02:31:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-11-26 02:31:59,846 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-11-26 02:31:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:59,847 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-11-26 02:31:59,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-11-26 02:31:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:31:59,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:59,851 INFO L410 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] [2019-11-26 02:31:59,851 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1684353003, now seen corresponding path program 1 times [2019-11-26 02:31:59,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:59,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811037204] [2019-11-26 02:31:59,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:00,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811037204] [2019-11-26 02:32:00,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:00,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 02:32:00,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038494745] [2019-11-26 02:32:00,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:32:00,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:32:00,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:32:00,006 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 8 states. [2019-11-26 02:32:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:00,374 INFO L93 Difference]: Finished difference Result 3633 states and 8221 transitions. [2019-11-26 02:32:00,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:32:00,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-26 02:32:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:00,377 INFO L225 Difference]: With dead ends: 3633 [2019-11-26 02:32:00,377 INFO L226 Difference]: Without dead ends: 3611 [2019-11-26 02:32:00,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:32:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2019-11-26 02:32:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3165. [2019-11-26 02:32:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-11-26 02:32:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-11-26 02:32:00,405 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-11-26 02:32:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:00,405 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-11-26 02:32:00,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:32:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-11-26 02:32:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:32:00,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:00,408 INFO L410 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] [2019-11-26 02:32:00,408 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1723110612, now seen corresponding path program 1 times [2019-11-26 02:32:00,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:00,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078723431] [2019-11-26 02:32:00,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:00,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078723431] [2019-11-26 02:32:00,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:00,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 02:32:00,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047878672] [2019-11-26 02:32:00,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:32:00,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:00,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:32:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:32:00,569 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 9 states. [2019-11-26 02:32:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:01,006 INFO L93 Difference]: Finished difference Result 11435 states and 26306 transitions. [2019-11-26 02:32:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 02:32:01,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-26 02:32:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:01,012 INFO L225 Difference]: With dead ends: 11435 [2019-11-26 02:32:01,012 INFO L226 Difference]: Without dead ends: 7337 [2019-11-26 02:32:01,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:32:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2019-11-26 02:32:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 3288. [2019-11-26 02:32:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-11-26 02:32:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7466 transitions. [2019-11-26 02:32:01,057 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7466 transitions. Word has length 85 [2019-11-26 02:32:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:01,057 INFO L462 AbstractCegarLoop]: Abstraction has 3288 states and 7466 transitions. [2019-11-26 02:32:01,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:32:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7466 transitions. [2019-11-26 02:32:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:32:01,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:01,061 INFO L410 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] [2019-11-26 02:32:01,061 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash -462193777, now seen corresponding path program 1 times [2019-11-26 02:32:01,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:01,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973544032] [2019-11-26 02:32:01,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:01,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973544032] [2019-11-26 02:32:01,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:01,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:32:01,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703036658] [2019-11-26 02:32:01,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:32:01,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:01,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:32:01,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:32:01,182 INFO L87 Difference]: Start difference. First operand 3288 states and 7466 transitions. Second operand 6 states. [2019-11-26 02:32:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:01,387 INFO L93 Difference]: Finished difference Result 3693 states and 8318 transitions. [2019-11-26 02:32:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:32:01,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-26 02:32:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:01,390 INFO L225 Difference]: With dead ends: 3693 [2019-11-26 02:32:01,390 INFO L226 Difference]: Without dead ends: 3621 [2019-11-26 02:32:01,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:32:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-11-26 02:32:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3182. [2019-11-26 02:32:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-11-26 02:32:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7161 transitions. [2019-11-26 02:32:01,416 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7161 transitions. Word has length 85 [2019-11-26 02:32:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:01,416 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7161 transitions. [2019-11-26 02:32:01,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:32:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7161 transitions. [2019-11-26 02:32:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:32:01,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:01,418 INFO L410 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] [2019-11-26 02:32:01,418 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1755564176, now seen corresponding path program 2 times [2019-11-26 02:32:01,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:01,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757935786] [2019-11-26 02:32:01,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:01,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757935786] [2019-11-26 02:32:01,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:01,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:32:01,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307587394] [2019-11-26 02:32:01,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:32:01,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:32:01,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:32:01,567 INFO L87 Difference]: Start difference. First operand 3182 states and 7161 transitions. Second operand 7 states. [2019-11-26 02:32:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:01,650 INFO L93 Difference]: Finished difference Result 5397 states and 12204 transitions. [2019-11-26 02:32:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:32:01,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-11-26 02:32:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:01,652 INFO L225 Difference]: With dead ends: 5397 [2019-11-26 02:32:01,652 INFO L226 Difference]: Without dead ends: 2304 [2019-11-26 02:32:01,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:32:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-11-26 02:32:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2019-11-26 02:32:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-11-26 02:32:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-11-26 02:32:01,669 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-11-26 02:32:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:01,669 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-11-26 02:32:01,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:32:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-11-26 02:32:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:32:01,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:01,671 INFO L410 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] [2019-11-26 02:32:01,671 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1045262002, now seen corresponding path program 3 times [2019-11-26 02:32:01,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:01,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594218245] [2019-11-26 02:32:01,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:01,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594218245] [2019-11-26 02:32:01,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:01,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 02:32:01,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061425535] [2019-11-26 02:32:01,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:32:01,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:32:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:32:01,827 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 10 states. [2019-11-26 02:32:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:02,098 INFO L93 Difference]: Finished difference Result 3848 states and 8668 transitions. [2019-11-26 02:32:02,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:32:02,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-11-26 02:32:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:02,100 INFO L225 Difference]: With dead ends: 3848 [2019-11-26 02:32:02,100 INFO L226 Difference]: Without dead ends: 2516 [2019-11-26 02:32:02,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:32:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-26 02:32:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2286. [2019-11-26 02:32:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-11-26 02:32:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 5151 transitions. [2019-11-26 02:32:02,119 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 5151 transitions. Word has length 85 [2019-11-26 02:32:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:02,119 INFO L462 AbstractCegarLoop]: Abstraction has 2286 states and 5151 transitions. [2019-11-26 02:32:02,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:32:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 5151 transitions. [2019-11-26 02:32:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:32:02,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:02,122 INFO L410 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] [2019-11-26 02:32:02,122 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:02,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1773753292, now seen corresponding path program 4 times [2019-11-26 02:32:02,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:02,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681884088] [2019-11-26 02:32:02,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:02,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681884088] [2019-11-26 02:32:02,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:02,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:32:02,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570597154] [2019-11-26 02:32:02,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:32:02,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:02,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:32:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:32:02,207 INFO L87 Difference]: Start difference. First operand 2286 states and 5151 transitions. Second operand 5 states. [2019-11-26 02:32:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:02,261 INFO L93 Difference]: Finished difference Result 2411 states and 5406 transitions. [2019-11-26 02:32:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:32:02,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-26 02:32:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:02,264 INFO L225 Difference]: With dead ends: 2411 [2019-11-26 02:32:02,264 INFO L226 Difference]: Without dead ends: 2411 [2019-11-26 02:32:02,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:32:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-11-26 02:32:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2370. [2019-11-26 02:32:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-11-26 02:32:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 5321 transitions. [2019-11-26 02:32:02,291 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 5321 transitions. Word has length 85 [2019-11-26 02:32:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:02,291 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 5321 transitions. [2019-11-26 02:32:02,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:32:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 5321 transitions. [2019-11-26 02:32:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:32:02,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:02,294 INFO L410 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] [2019-11-26 02:32:02,294 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1562402379, now seen corresponding path program 1 times [2019-11-26 02:32:02,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:02,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850134141] [2019-11-26 02:32:02,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:32:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:32:02,385 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:32:02,385 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:32:02,547 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-26 02:32:02,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:32:02 BasicIcfg [2019-11-26 02:32:02,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:32:02,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:32:02,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:32:02,550 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:32:02,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:31:32" (3/4) ... [2019-11-26 02:32:02,559 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:32:02,732 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1254d530-e0aa-4e92-bf62-39e4f55a8daa/bin/utaipan/witness.graphml [2019-11-26 02:32:02,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:32:02,734 INFO L168 Benchmark]: Toolchain (without parser) took 31823.88 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 939.4 MB in the beginning and 1.7 GB in the end (delta: -808.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-26 02:32:02,734 INFO L168 Benchmark]: CDTParser took 5.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:32:02,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:02,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:02,735 INFO L168 Benchmark]: Boogie Preprocessor took 82.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:32:02,736 INFO L168 Benchmark]: RCFGBuilder took 756.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:02,736 INFO L168 Benchmark]: TraceAbstraction took 30092.66 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -765.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-26 02:32:02,736 INFO L168 Benchmark]: Witness Printer took 183.02 ms. Allocated memory is still 4.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:02,739 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 5.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 633.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.70 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 756.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30092.66 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -765.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 183.02 ms. Allocated memory is still 4.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1641; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1642; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 328 locations, 5 error locations. Result: UNSAFE, OverallTime: 29.8s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7437 SDtfs, 8630 SDslu, 18262 SDs, 0 SdLazy, 6093 SolverSat, 435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 71834 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1916 NumberOfCodeBlocks, 1916 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1803 ConstructedInterpolants, 0 QuantifiedInterpolants, 370560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...