./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/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 29f714a86a33b0ea6c8fe0ee1d7a3bc5f936e62d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 19:09:15,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:09:15,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:09:15,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:09:15,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:09:15,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:09:15,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:09:15,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:09:15,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:09:15,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:09:15,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:09:15,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:09:15,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:09:15,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:09:15,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:09:15,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:09:15,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:09:15,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:09:15,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:09:15,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:09:15,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:09:15,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:09:15,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:09:15,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:09:15,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:09:15,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:09:15,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:09:15,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:09:15,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:09:15,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:09:15,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:09:15,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:09:15,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:09:15,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:09:15,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:09:15,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:09:15,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:09:15,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:09:15,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:09:15,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:09:15,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:09:15,982 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:09:15,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:09:15,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:09:15,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:09:15,995 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:09:15,995 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:09:15,996 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:09:15,996 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:09:15,996 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:09:15,996 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:09:15,996 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:09:15,997 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:09:15,997 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:09:15,997 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:09:15,997 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:09:15,998 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:09:15,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:09:15,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:09:15,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:09:15,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:09:15,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:09:15,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:09:15,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:09:16,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:09:16,000 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:09:16,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:09:16,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:09:16,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:09:16,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:09:16,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:09:16,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:09:16,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:09:16,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:09:16,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:09:16,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:09:16,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:09:16,002 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:09:16,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:09:16,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:09:16,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:09:16,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:09:16,003 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_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/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 -> 29f714a86a33b0ea6c8fe0ee1d7a3bc5f936e62d [2019-12-07 19:09:16,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:09:16,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:09:16,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:09:16,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:09:16,123 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:09:16,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i [2019-12-07 19:09:16,164 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/data/6c55e29ca/f802cf00b88847eb896866ee924e532c/FLAG767f2adbc [2019-12-07 19:09:16,531 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:09:16,532 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i [2019-12-07 19:09:16,545 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/data/6c55e29ca/f802cf00b88847eb896866ee924e532c/FLAG767f2adbc [2019-12-07 19:09:16,556 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/data/6c55e29ca/f802cf00b88847eb896866ee924e532c [2019-12-07 19:09:16,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:09:16,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:09:16,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:09:16,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:09:16,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:09:16,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:16,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16, skipping insertion in model container [2019-12-07 19:09:16,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:16,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:09:16,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:09:16,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:09:16,864 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:09:16,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:09:16,958 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:09:16,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16 WrapperNode [2019-12-07 19:09:16,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:09:16,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:09:16,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:09:16,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:09:16,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:16,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:09:17,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:09:17,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:09:17,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:09:17,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... [2019-12-07 19:09:17,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:09:17,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:09:17,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:09:17,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:09:17,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/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-12-07 19:09:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:09:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:09:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:09:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:09:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:09:17,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:09:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:09:17,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:09:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:09:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:09:17,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:09:17,079 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 19:09:17,560 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:09:17,560 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:09:17,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:09:17 BoogieIcfgContainer [2019-12-07 19:09:17,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:09:17,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:09:17,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:09:17,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:09:17,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:09:16" (1/3) ... [2019-12-07 19:09:17,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75319407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:09:17, skipping insertion in model container [2019-12-07 19:09:17,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:09:16" (2/3) ... [2019-12-07 19:09:17,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75319407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:09:17, skipping insertion in model container [2019-12-07 19:09:17,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:09:17" (3/3) ... [2019-12-07 19:09:17,565 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.oepc.i [2019-12-07 19:09:17,571 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:09:17,571 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:09:17,576 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:09:17,576 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:09:17,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:09:17,641 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 19:09:17,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:09:17,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:09:17,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:09:17,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:09:17,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:09:17,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:09:17,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:09:17,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:09:17,667 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-07 19:09:17,668 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 19:09:17,748 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 19:09:17,748 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:09:17,765 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 19:09:17,806 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 19:09:17,860 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 19:09:17,860 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:09:17,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 19:09:17,906 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-07 19:09:17,907 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:09:21,604 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 19:09:21,723 INFO L206 etLargeBlockEncoding]: Checked pairs total: 238871 [2019-12-07 19:09:21,723 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 19:09:21,725 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 186 transitions [2019-12-07 19:09:25,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55330 states. [2019-12-07 19:09:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states. [2019-12-07 19:09:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:09:25,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:25,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:09:25,098 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1316112, now seen corresponding path program 1 times [2019-12-07 19:09:25,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:25,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486825969] [2019-12-07 19:09:25,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:25,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486825969] [2019-12-07 19:09:25,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:25,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:09:25,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914002130] [2019-12-07 19:09:25,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:25,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:25,257 INFO L87 Difference]: Start difference. First operand 55330 states. Second operand 3 states. [2019-12-07 19:09:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:25,763 INFO L93 Difference]: Finished difference Result 55134 states and 195732 transitions. [2019-12-07 19:09:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:25,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:09:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:26,038 INFO L225 Difference]: With dead ends: 55134 [2019-12-07 19:09:26,038 INFO L226 Difference]: Without dead ends: 54186 [2019-12-07 19:09:26,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 19:09:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-07 19:09:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 54186. [2019-12-07 19:09:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54186 states. [2019-12-07 19:09:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54186 states to 54186 states and 192533 transitions. [2019-12-07 19:09:27,771 INFO L78 Accepts]: Start accepts. Automaton has 54186 states and 192533 transitions. Word has length 3 [2019-12-07 19:09:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:27,772 INFO L462 AbstractCegarLoop]: Abstraction has 54186 states and 192533 transitions. [2019-12-07 19:09:27,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 54186 states and 192533 transitions. [2019-12-07 19:09:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:09:27,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:27,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:27,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1209114037, now seen corresponding path program 1 times [2019-12-07 19:09:27,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:27,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455635747] [2019-12-07 19:09:27,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:27,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455635747] [2019-12-07 19:09:27,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:27,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:27,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014073729] [2019-12-07 19:09:27,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:27,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:27,857 INFO L87 Difference]: Start difference. First operand 54186 states and 192533 transitions. Second operand 4 states. [2019-12-07 19:09:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:28,519 INFO L93 Difference]: Finished difference Result 73782 states and 254483 transitions. [2019-12-07 19:09:28,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:28,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:09:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:28,822 INFO L225 Difference]: With dead ends: 73782 [2019-12-07 19:09:28,822 INFO L226 Difference]: Without dead ends: 73782 [2019-12-07 19:09:28,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-07 19:09:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73782 states. [2019-12-07 19:09:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73782 to 73598. [2019-12-07 19:09:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73598 states. [2019-12-07 19:09:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73598 states to 73598 states and 253973 transitions. [2019-12-07 19:09:30,622 INFO L78 Accepts]: Start accepts. Automaton has 73598 states and 253973 transitions. Word has length 11 [2019-12-07 19:09:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:30,623 INFO L462 AbstractCegarLoop]: Abstraction has 73598 states and 253973 transitions. [2019-12-07 19:09:30,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73598 states and 253973 transitions. [2019-12-07 19:09:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:09:30,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:30,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:30,627 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash 196484102, now seen corresponding path program 1 times [2019-12-07 19:09:30,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:30,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6550477] [2019-12-07 19:09:30,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:30,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6550477] [2019-12-07 19:09:30,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:30,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:30,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127101112] [2019-12-07 19:09:30,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:30,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:30,676 INFO L87 Difference]: Start difference. First operand 73598 states and 253973 transitions. Second operand 4 states. [2019-12-07 19:09:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:31,273 INFO L93 Difference]: Finished difference Result 91082 states and 310643 transitions. [2019-12-07 19:09:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:31,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:09:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:31,415 INFO L225 Difference]: With dead ends: 91082 [2019-12-07 19:09:31,416 INFO L226 Difference]: Without dead ends: 91082 [2019-12-07 19:09:31,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 19:09:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91082 states. [2019-12-07 19:09:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91082 to 84490. [2019-12-07 19:09:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84490 states. [2019-12-07 19:09:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84490 states to 84490 states and 288958 transitions. [2019-12-07 19:09:33,482 INFO L78 Accepts]: Start accepts. Automaton has 84490 states and 288958 transitions. Word has length 14 [2019-12-07 19:09:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:33,483 INFO L462 AbstractCegarLoop]: Abstraction has 84490 states and 288958 transitions. [2019-12-07 19:09:33,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 84490 states and 288958 transitions. [2019-12-07 19:09:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:09:33,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:33,488 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] [2019-12-07 19:09:33,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1667995754, now seen corresponding path program 1 times [2019-12-07 19:09:33,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:33,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214324720] [2019-12-07 19:09:33,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:33,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214324720] [2019-12-07 19:09:33,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:33,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:33,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886501367] [2019-12-07 19:09:33,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:33,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:33,539 INFO L87 Difference]: Start difference. First operand 84490 states and 288958 transitions. Second operand 4 states. [2019-12-07 19:09:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:33,576 INFO L93 Difference]: Finished difference Result 8514 states and 21866 transitions. [2019-12-07 19:09:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:09:33,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 19:09:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:33,583 INFO L225 Difference]: With dead ends: 8514 [2019-12-07 19:09:33,583 INFO L226 Difference]: Without dead ends: 7230 [2019-12-07 19:09:33,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 19:09:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-07 19:09:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7222. [2019-12-07 19:09:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2019-12-07 19:09:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 17730 transitions. [2019-12-07 19:09:33,658 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 17730 transitions. Word has length 20 [2019-12-07 19:09:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:33,658 INFO L462 AbstractCegarLoop]: Abstraction has 7222 states and 17730 transitions. [2019-12-07 19:09:33,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 17730 transitions. [2019-12-07 19:09:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:09:33,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:33,660 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] [2019-12-07 19:09:33,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1725930936, now seen corresponding path program 1 times [2019-12-07 19:09:33,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:33,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012430939] [2019-12-07 19:09:33,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:33,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012430939] [2019-12-07 19:09:33,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:33,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:33,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216663643] [2019-12-07 19:09:33,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:33,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:33,721 INFO L87 Difference]: Start difference. First operand 7222 states and 17730 transitions. Second operand 5 states. [2019-12-07 19:09:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:34,013 INFO L93 Difference]: Finished difference Result 8308 states and 20180 transitions. [2019-12-07 19:09:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:09:34,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 19:09:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:34,019 INFO L225 Difference]: With dead ends: 8308 [2019-12-07 19:09:34,019 INFO L226 Difference]: Without dead ends: 8308 [2019-12-07 19:09:34,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2019-12-07 19:09:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8206. [2019-12-07 19:09:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-12-07 19:09:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 19982 transitions. [2019-12-07 19:09:34,104 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 19982 transitions. Word has length 30 [2019-12-07 19:09:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:34,105 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 19982 transitions. [2019-12-07 19:09:34,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 19982 transitions. [2019-12-07 19:09:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:09:34,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:34,107 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] [2019-12-07 19:09:34,107 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1964223061, now seen corresponding path program 1 times [2019-12-07 19:09:34,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:34,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012577989] [2019-12-07 19:09:34,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:34,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012577989] [2019-12-07 19:09:34,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:34,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:34,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997259319] [2019-12-07 19:09:34,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:34,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:34,131 INFO L87 Difference]: Start difference. First operand 8206 states and 19982 transitions. Second operand 3 states. [2019-12-07 19:09:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:34,214 INFO L93 Difference]: Finished difference Result 12335 states and 28548 transitions. [2019-12-07 19:09:34,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:34,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 19:09:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:34,225 INFO L225 Difference]: With dead ends: 12335 [2019-12-07 19:09:34,225 INFO L226 Difference]: Without dead ends: 12335 [2019-12-07 19:09:34,225 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-12-07 19:09:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2019-12-07 19:09:34,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 11324. [2019-12-07 19:09:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-07 19:09:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 26462 transitions. [2019-12-07 19:09:34,369 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 26462 transitions. Word has length 31 [2019-12-07 19:09:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:34,370 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 26462 transitions. [2019-12-07 19:09:34,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 26462 transitions. [2019-12-07 19:09:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:09:34,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:34,372 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] [2019-12-07 19:09:34,372 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -71378589, now seen corresponding path program 1 times [2019-12-07 19:09:34,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:34,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229117696] [2019-12-07 19:09:34,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:34,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229117696] [2019-12-07 19:09:34,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:34,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:34,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290745175] [2019-12-07 19:09:34,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:34,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:34,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:34,425 INFO L87 Difference]: Start difference. First operand 11324 states and 26462 transitions. Second operand 5 states. [2019-12-07 19:09:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:34,750 INFO L93 Difference]: Finished difference Result 12877 states and 29790 transitions. [2019-12-07 19:09:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:09:34,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 19:09:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:34,761 INFO L225 Difference]: With dead ends: 12877 [2019-12-07 19:09:34,761 INFO L226 Difference]: Without dead ends: 12877 [2019-12-07 19:09:34,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-07 19:09:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 11566. [2019-12-07 19:09:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-12-07 19:09:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 27002 transitions. [2019-12-07 19:09:34,877 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 27002 transitions. Word has length 33 [2019-12-07 19:09:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:34,877 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 27002 transitions. [2019-12-07 19:09:34,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 27002 transitions. [2019-12-07 19:09:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:09:34,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:34,883 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] [2019-12-07 19:09:34,883 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1192698792, now seen corresponding path program 1 times [2019-12-07 19:09:34,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:34,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446379210] [2019-12-07 19:09:34,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:34,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446379210] [2019-12-07 19:09:34,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:34,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:34,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882495650] [2019-12-07 19:09:34,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:34,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:34,976 INFO L87 Difference]: Start difference. First operand 11566 states and 27002 transitions. Second operand 5 states. [2019-12-07 19:09:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:35,097 INFO L93 Difference]: Finished difference Result 12422 states and 28901 transitions. [2019-12-07 19:09:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:09:35,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 19:09:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:35,106 INFO L225 Difference]: With dead ends: 12422 [2019-12-07 19:09:35,106 INFO L226 Difference]: Without dead ends: 12060 [2019-12-07 19:09:35,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-12-07 19:09:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12060 states. [2019-12-07 19:09:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12060 to 11633. [2019-12-07 19:09:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2019-12-07 19:09:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 27076 transitions. [2019-12-07 19:09:35,224 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 27076 transitions. Word has length 42 [2019-12-07 19:09:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:35,224 INFO L462 AbstractCegarLoop]: Abstraction has 11633 states and 27076 transitions. [2019-12-07 19:09:35,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 27076 transitions. [2019-12-07 19:09:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 19:09:35,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:35,229 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] [2019-12-07 19:09:35,229 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1557518893, now seen corresponding path program 1 times [2019-12-07 19:09:35,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:35,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617813528] [2019-12-07 19:09:35,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:35,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617813528] [2019-12-07 19:09:35,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:35,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:35,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433555237] [2019-12-07 19:09:35,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:09:35,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:09:35,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:35,304 INFO L87 Difference]: Start difference. First operand 11633 states and 27076 transitions. Second operand 6 states. [2019-12-07 19:09:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:35,719 INFO L93 Difference]: Finished difference Result 13717 states and 31382 transitions. [2019-12-07 19:09:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:09:35,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 19:09:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:35,730 INFO L225 Difference]: With dead ends: 13717 [2019-12-07 19:09:35,730 INFO L226 Difference]: Without dead ends: 13692 [2019-12-07 19:09:35,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:09:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2019-12-07 19:09:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 12874. [2019-12-07 19:09:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12874 states. [2019-12-07 19:09:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12874 states to 12874 states and 29756 transitions. [2019-12-07 19:09:35,857 INFO L78 Accepts]: Start accepts. Automaton has 12874 states and 29756 transitions. Word has length 43 [2019-12-07 19:09:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:35,857 INFO L462 AbstractCegarLoop]: Abstraction has 12874 states and 29756 transitions. [2019-12-07 19:09:35,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:09:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12874 states and 29756 transitions. [2019-12-07 19:09:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 19:09:35,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:35,863 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] [2019-12-07 19:09:35,863 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1777006862, now seen corresponding path program 1 times [2019-12-07 19:09:35,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:35,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913229361] [2019-12-07 19:09:35,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:35,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913229361] [2019-12-07 19:09:35,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:35,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:35,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730715603] [2019-12-07 19:09:35,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:35,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:35,895 INFO L87 Difference]: Start difference. First operand 12874 states and 29756 transitions. Second operand 3 states. [2019-12-07 19:09:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:35,990 INFO L93 Difference]: Finished difference Result 14139 states and 30703 transitions. [2019-12-07 19:09:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:35,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 19:09:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:36,001 INFO L225 Difference]: With dead ends: 14139 [2019-12-07 19:09:36,001 INFO L226 Difference]: Without dead ends: 14139 [2019-12-07 19:09:36,001 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-12-07 19:09:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14139 states. [2019-12-07 19:09:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14139 to 13323. [2019-12-07 19:09:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13323 states. [2019-12-07 19:09:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13323 states to 13323 states and 29038 transitions. [2019-12-07 19:09:36,136 INFO L78 Accepts]: Start accepts. Automaton has 13323 states and 29038 transitions. Word has length 46 [2019-12-07 19:09:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:36,137 INFO L462 AbstractCegarLoop]: Abstraction has 13323 states and 29038 transitions. [2019-12-07 19:09:36,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 13323 states and 29038 transitions. [2019-12-07 19:09:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 19:09:36,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:36,143 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] [2019-12-07 19:09:36,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -753849587, now seen corresponding path program 1 times [2019-12-07 19:09:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:36,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786992788] [2019-12-07 19:09:36,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:36,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786992788] [2019-12-07 19:09:36,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:36,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:36,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201320179] [2019-12-07 19:09:36,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:09:36,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:09:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:36,217 INFO L87 Difference]: Start difference. First operand 13323 states and 29038 transitions. Second operand 6 states. [2019-12-07 19:09:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:36,693 INFO L93 Difference]: Finished difference Result 14371 states and 31038 transitions. [2019-12-07 19:09:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:09:36,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 19:09:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:36,705 INFO L225 Difference]: With dead ends: 14371 [2019-12-07 19:09:36,706 INFO L226 Difference]: Without dead ends: 14303 [2019-12-07 19:09:36,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:09:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-12-07 19:09:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 12587. [2019-12-07 19:09:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12587 states. [2019-12-07 19:09:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12587 states to 12587 states and 27531 transitions. [2019-12-07 19:09:36,859 INFO L78 Accepts]: Start accepts. Automaton has 12587 states and 27531 transitions. Word has length 49 [2019-12-07 19:09:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:36,859 INFO L462 AbstractCegarLoop]: Abstraction has 12587 states and 27531 transitions. [2019-12-07 19:09:36,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:09:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 12587 states and 27531 transitions. [2019-12-07 19:09:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:09:36,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:36,867 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-12-07 19:09:36,868 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:36,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1658446064, now seen corresponding path program 1 times [2019-12-07 19:09:36,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:36,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576767006] [2019-12-07 19:09:36,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:36,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576767006] [2019-12-07 19:09:36,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:36,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:36,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991784432] [2019-12-07 19:09:36,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:36,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:36,927 INFO L87 Difference]: Start difference. First operand 12587 states and 27531 transitions. Second operand 5 states. [2019-12-07 19:09:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:36,962 INFO L93 Difference]: Finished difference Result 2266 states and 4592 transitions. [2019-12-07 19:09:36,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:36,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 19:09:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:36,964 INFO L225 Difference]: With dead ends: 2266 [2019-12-07 19:09:36,964 INFO L226 Difference]: Without dead ends: 2082 [2019-12-07 19:09:36,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-07 19:09:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-12-07 19:09:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2036. [2019-12-07 19:09:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2019-12-07 19:09:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 4127 transitions. [2019-12-07 19:09:36,982 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 4127 transitions. Word has length 55 [2019-12-07 19:09:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:36,982 INFO L462 AbstractCegarLoop]: Abstraction has 2036 states and 4127 transitions. [2019-12-07 19:09:36,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 4127 transitions. [2019-12-07 19:09:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 19:09:36,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:36,984 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-12-07 19:09:36,985 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash -253914571, now seen corresponding path program 1 times [2019-12-07 19:09:36,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:36,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517783867] [2019-12-07 19:09:36,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:37,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517783867] [2019-12-07 19:09:37,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:37,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:37,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634503296] [2019-12-07 19:09:37,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:37,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:37,040 INFO L87 Difference]: Start difference. First operand 2036 states and 4127 transitions. Second operand 5 states. [2019-12-07 19:09:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:37,163 INFO L93 Difference]: Finished difference Result 3209 states and 6530 transitions. [2019-12-07 19:09:37,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:37,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-07 19:09:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:37,165 INFO L225 Difference]: With dead ends: 3209 [2019-12-07 19:09:37,165 INFO L226 Difference]: Without dead ends: 3209 [2019-12-07 19:09:37,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2019-12-07 19:09:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2789. [2019-12-07 19:09:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-12-07 19:09:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 5726 transitions. [2019-12-07 19:09:37,188 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 5726 transitions. Word has length 85 [2019-12-07 19:09:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:37,188 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 5726 transitions. [2019-12-07 19:09:37,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 5726 transitions. [2019-12-07 19:09:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:09:37,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:37,191 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, 1] [2019-12-07 19:09:37,191 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash -963574665, now seen corresponding path program 1 times [2019-12-07 19:09:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:37,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791099436] [2019-12-07 19:09:37,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:37,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791099436] [2019-12-07 19:09:37,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:37,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:09:37,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237612170] [2019-12-07 19:09:37,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:09:37,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:09:37,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:09:37,322 INFO L87 Difference]: Start difference. First operand 2789 states and 5726 transitions. Second operand 9 states. [2019-12-07 19:09:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:38,181 INFO L93 Difference]: Finished difference Result 4602 states and 9259 transitions. [2019-12-07 19:09:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:09:38,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 19:09:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:38,184 INFO L225 Difference]: With dead ends: 4602 [2019-12-07 19:09:38,184 INFO L226 Difference]: Without dead ends: 4602 [2019-12-07 19:09:38,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:09:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2019-12-07 19:09:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3782. [2019-12-07 19:09:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-12-07 19:09:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 7713 transitions. [2019-12-07 19:09:38,215 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 7713 transitions. Word has length 86 [2019-12-07 19:09:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:38,215 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 7713 transitions. [2019-12-07 19:09:38,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:09:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 7713 transitions. [2019-12-07 19:09:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:09:38,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:38,219 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, 1] [2019-12-07 19:09:38,219 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1311447091, now seen corresponding path program 2 times [2019-12-07 19:09:38,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:38,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480038489] [2019-12-07 19:09:38,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:38,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480038489] [2019-12-07 19:09:38,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:38,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:09:38,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105724235] [2019-12-07 19:09:38,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:09:38,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:38,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:09:38,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:09:38,339 INFO L87 Difference]: Start difference. First operand 3782 states and 7713 transitions. Second operand 9 states. [2019-12-07 19:09:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:38,942 INFO L93 Difference]: Finished difference Result 13548 states and 27456 transitions. [2019-12-07 19:09:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:09:38,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 19:09:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:38,949 INFO L225 Difference]: With dead ends: 13548 [2019-12-07 19:09:38,949 INFO L226 Difference]: Without dead ends: 10658 [2019-12-07 19:09:38,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:09:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10658 states. [2019-12-07 19:09:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10658 to 3901. [2019-12-07 19:09:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-12-07 19:09:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 7922 transitions. [2019-12-07 19:09:39,005 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 7922 transitions. Word has length 86 [2019-12-07 19:09:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:39,005 INFO L462 AbstractCegarLoop]: Abstraction has 3901 states and 7922 transitions. [2019-12-07 19:09:39,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:09:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 7922 transitions. [2019-12-07 19:09:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:09:39,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:39,009 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, 1] [2019-12-07 19:09:39,009 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1447020425, now seen corresponding path program 3 times [2019-12-07 19:09:39,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:39,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267762240] [2019-12-07 19:09:39,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:39,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267762240] [2019-12-07 19:09:39,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:39,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:09:39,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120643388] [2019-12-07 19:09:39,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:09:39,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:09:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:09:39,118 INFO L87 Difference]: Start difference. First operand 3901 states and 7922 transitions. Second operand 9 states. [2019-12-07 19:09:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:39,701 INFO L93 Difference]: Finished difference Result 11230 states and 22687 transitions. [2019-12-07 19:09:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:09:39,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 19:09:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:39,707 INFO L225 Difference]: With dead ends: 11230 [2019-12-07 19:09:39,707 INFO L226 Difference]: Without dead ends: 8734 [2019-12-07 19:09:39,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:09:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2019-12-07 19:09:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 4260. [2019-12-07 19:09:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-12-07 19:09:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 8617 transitions. [2019-12-07 19:09:39,762 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 8617 transitions. Word has length 86 [2019-12-07 19:09:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:39,762 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 8617 transitions. [2019-12-07 19:09:39,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:09:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 8617 transitions. [2019-12-07 19:09:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:09:39,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:39,767 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, 1] [2019-12-07 19:09:39,767 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1202316937, now seen corresponding path program 4 times [2019-12-07 19:09:39,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:39,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329109021] [2019-12-07 19:09:39,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:40,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329109021] [2019-12-07 19:09:40,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:40,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 19:09:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492590231] [2019-12-07 19:09:40,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:09:40,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:09:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:09:40,061 INFO L87 Difference]: Start difference. First operand 4260 states and 8617 transitions. Second operand 14 states. [2019-12-07 19:09:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:44,769 INFO L93 Difference]: Finished difference Result 6463 states and 12697 transitions. [2019-12-07 19:09:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:09:44,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2019-12-07 19:09:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:44,773 INFO L225 Difference]: With dead ends: 6463 [2019-12-07 19:09:44,774 INFO L226 Difference]: Without dead ends: 6457 [2019-12-07 19:09:44,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:09:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2019-12-07 19:09:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 4355. [2019-12-07 19:09:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2019-12-07 19:09:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 8743 transitions. [2019-12-07 19:09:44,833 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 8743 transitions. Word has length 86 [2019-12-07 19:09:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:44,833 INFO L462 AbstractCegarLoop]: Abstraction has 4355 states and 8743 transitions. [2019-12-07 19:09:44,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:09:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 8743 transitions. [2019-12-07 19:09:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:09:44,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:44,839 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, 1] [2019-12-07 19:09:44,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash 538011113, now seen corresponding path program 5 times [2019-12-07 19:09:44,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:44,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996306106] [2019-12-07 19:09:44,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:44,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996306106] [2019-12-07 19:09:44,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:44,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:44,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101103010] [2019-12-07 19:09:44,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:44,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:44,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:44,942 INFO L87 Difference]: Start difference. First operand 4355 states and 8743 transitions. Second operand 5 states. [2019-12-07 19:09:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:45,017 INFO L93 Difference]: Finished difference Result 7274 states and 14498 transitions. [2019-12-07 19:09:45,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:45,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-07 19:09:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:45,020 INFO L225 Difference]: With dead ends: 7274 [2019-12-07 19:09:45,020 INFO L226 Difference]: Without dead ends: 2966 [2019-12-07 19:09:45,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-12-07 19:09:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2822. [2019-12-07 19:09:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-07 19:09:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 5571 transitions. [2019-12-07 19:09:45,052 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 5571 transitions. Word has length 86 [2019-12-07 19:09:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:45,052 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 5571 transitions. [2019-12-07 19:09:45,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 5571 transitions. [2019-12-07 19:09:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 19:09:45,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:45,056 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, 1] [2019-12-07 19:09:45,056 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 157860683, now seen corresponding path program 6 times [2019-12-07 19:09:45,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:45,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441184345] [2019-12-07 19:09:45,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:45,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441184345] [2019-12-07 19:09:45,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:45,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:45,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750142103] [2019-12-07 19:09:45,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:45,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:45,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:45,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:45,106 INFO L87 Difference]: Start difference. First operand 2822 states and 5571 transitions. Second operand 3 states. [2019-12-07 19:09:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:45,134 INFO L93 Difference]: Finished difference Result 2821 states and 5569 transitions. [2019-12-07 19:09:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:45,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 19:09:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:45,136 INFO L225 Difference]: With dead ends: 2821 [2019-12-07 19:09:45,136 INFO L226 Difference]: Without dead ends: 2821 [2019-12-07 19:09:45,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 19:09:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2019-12-07 19:09:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2419. [2019-12-07 19:09:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2019-12-07 19:09:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 4818 transitions. [2019-12-07 19:09:45,157 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 4818 transitions. Word has length 86 [2019-12-07 19:09:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:45,158 INFO L462 AbstractCegarLoop]: Abstraction has 2419 states and 4818 transitions. [2019-12-07 19:09:45,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 4818 transitions. [2019-12-07 19:09:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 19:09:45,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:45,160 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, 1, 1] [2019-12-07 19:09:45,160 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash -768002551, now seen corresponding path program 1 times [2019-12-07 19:09:45,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:45,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099037589] [2019-12-07 19:09:45,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099037589] [2019-12-07 19:09:45,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:45,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 19:09:45,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217217957] [2019-12-07 19:09:45,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 19:09:45,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 19:09:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:09:45,567 INFO L87 Difference]: Start difference. First operand 2419 states and 4818 transitions. Second operand 21 states. [2019-12-07 19:09:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:46,552 INFO L93 Difference]: Finished difference Result 6615 states and 13168 transitions. [2019-12-07 19:09:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 19:09:46,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-12-07 19:09:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:46,557 INFO L225 Difference]: With dead ends: 6615 [2019-12-07 19:09:46,557 INFO L226 Difference]: Without dead ends: 6574 [2019-12-07 19:09:46,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 19:09:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6574 states. [2019-12-07 19:09:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6574 to 4447. [2019-12-07 19:09:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2019-12-07 19:09:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 8908 transitions. [2019-12-07 19:09:46,597 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 8908 transitions. Word has length 87 [2019-12-07 19:09:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:46,598 INFO L462 AbstractCegarLoop]: Abstraction has 4447 states and 8908 transitions. [2019-12-07 19:09:46,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 19:09:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 8908 transitions. [2019-12-07 19:09:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 19:09:46,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:46,602 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, 1, 1] [2019-12-07 19:09:46,602 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:09:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash 927908343, now seen corresponding path program 2 times [2019-12-07 19:09:46,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:46,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369641938] [2019-12-07 19:09:46,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:09:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:09:46,694 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:09:46,694 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:09:46,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1593~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22|)) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22|) |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_19|, ULTIMATE.start_main_~#t1593~0.offset=|v_ULTIMATE.start_main_~#t1593~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ULTIMATE.start_main_~#t1593~0.base=|v_ULTIMATE.start_main_~#t1593~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_~#t1594~0.offset, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1593~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1593~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:09:46,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1594~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1594~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10|) |v_ULTIMATE.start_main_~#t1594~0.offset_9| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1594~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1594~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 19:09:46,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:09:46,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-242264121 256) 0))) (or (and .cse0 (= ~y~0_In-242264121 |P1Thread1of1ForFork1_#t~ite31_Out-242264121|)) (and (= ~y$mem_tmp~0_In-242264121 |P1Thread1of1ForFork1_#t~ite31_Out-242264121|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-242264121, ~y$flush_delayed~0=~y$flush_delayed~0_In-242264121, ~y~0=~y~0_In-242264121} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-242264121, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-242264121|, ~y$flush_delayed~0=~y$flush_delayed~0_In-242264121, ~y~0=~y~0_In-242264121} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 19:09:46,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-824899813 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-824899813 |P1Thread1of1ForFork1_#t~ite54_Out-824899813|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-824899813| ~y~0_In-824899813)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-824899813, ~y$flush_delayed~0=~y$flush_delayed~0_In-824899813, ~y~0=~y~0_In-824899813} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-824899813, ~y$flush_delayed~0=~y$flush_delayed~0_In-824899813, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-824899813|, ~y~0=~y~0_In-824899813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 19:09:46,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1598184631 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1598184631 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1598184631 |P0Thread1of1ForFork0_#t~ite5_Out-1598184631|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1598184631| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598184631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1598184631} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1598184631|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598184631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1598184631} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:09:46,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In934338631 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In934338631 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In934338631 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In934338631 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out934338631|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In934338631 |P0Thread1of1ForFork0_#t~ite6_Out934338631|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In934338631, ~y$w_buff0_used~0=~y$w_buff0_used~0_In934338631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In934338631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934338631} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out934338631|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In934338631, ~y$w_buff0_used~0=~y$w_buff0_used~0_In934338631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In934338631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934338631} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:09:46,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-940365868 ~y$r_buff0_thd1~0_Out-940365868)) (.cse0 (= (mod ~y$w_buff0_used~0_In-940365868 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-940365868 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-940365868) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-940365868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-940365868} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-940365868, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-940365868|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-940365868} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:09:46,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-636098448 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-636098448 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-636098448 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-636098448 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-636098448|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-636098448 |P0Thread1of1ForFork0_#t~ite8_Out-636098448|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-636098448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-636098448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-636098448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636098448} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-636098448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-636098448, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-636098448|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-636098448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636098448} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:09:46,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:09:46,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In464416697 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In464416697 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out464416697| |P1Thread1of1ForFork1_#t~ite55_Out464416697|))) (or (and (= |P1Thread1of1ForFork1_#t~ite55_Out464416697| ~y$w_buff1~0_In464416697) (not .cse0) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite55_Out464416697| ~y~0_In464416697) (or .cse0 .cse2) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In464416697, ~y$w_buff1~0=~y$w_buff1~0_In464416697, ~y~0=~y~0_In464416697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464416697} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In464416697, ~y$w_buff1~0=~y$w_buff1~0_In464416697, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out464416697|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out464416697|, ~y~0=~y~0_In464416697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464416697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 19:09:46,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1080327115 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1080327115 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1080327115 |P1Thread1of1ForFork1_#t~ite57_Out-1080327115|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out-1080327115|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080327115, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080327115} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080327115, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080327115, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-1080327115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 19:09:46,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In244398961 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In244398961 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In244398961 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In244398961 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out244398961|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In244398961 |P1Thread1of1ForFork1_#t~ite58_Out244398961|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In244398961, ~y$w_buff0_used~0=~y$w_buff0_used~0_In244398961, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In244398961, ~y$w_buff1_used~0=~y$w_buff1_used~0_In244398961} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In244398961, ~y$w_buff0_used~0=~y$w_buff0_used~0_In244398961, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In244398961, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out244398961|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In244398961} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 19:09:46,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In607944385 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In607944385 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite59_Out607944385| ~y$r_buff0_thd2~0_In607944385)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite59_Out607944385| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In607944385, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In607944385} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In607944385, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In607944385, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out607944385|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 19:09:46,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1376752986 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1376752986 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1376752986 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1376752986 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out-1376752986| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1376752986 |P1Thread1of1ForFork1_#t~ite60_Out-1376752986|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1376752986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376752986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1376752986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1376752986} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1376752986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376752986, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1376752986|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1376752986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1376752986} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 19:09:46,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:09:46,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:09:46,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1787654659 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1787654659 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out1787654659| ~y$w_buff1~0_In1787654659) (not .cse1)) (and (= ~y~0_In1787654659 |ULTIMATE.start_main_#t~ite63_Out1787654659|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1787654659, ~y~0=~y~0_In1787654659, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1787654659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787654659} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1787654659|, ~y$w_buff1~0=~y$w_buff1~0_In1787654659, ~y~0=~y~0_In1787654659, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1787654659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787654659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 19:09:46,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 19:09:46,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In868360735 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In868360735 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out868360735| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite65_Out868360735| ~y$w_buff0_used~0_In868360735)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In868360735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In868360735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In868360735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In868360735, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out868360735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 19:09:46,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In15969883 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In15969883 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In15969883 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In15969883 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out15969883| ~y$w_buff1_used~0_In15969883)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite66_Out15969883| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In15969883, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15969883, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In15969883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In15969883} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In15969883, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15969883, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out15969883|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In15969883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In15969883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 19:09:46,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1888291573 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1888291573 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out1888291573|)) (and (= ~y$r_buff0_thd0~0_In1888291573 |ULTIMATE.start_main_#t~ite67_Out1888291573|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1888291573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1888291573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1888291573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1888291573, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1888291573|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 19:09:46,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-761773860 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-761773860 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-761773860 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-761773860 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-761773860|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-761773860 |ULTIMATE.start_main_#t~ite68_Out-761773860|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-761773860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-761773860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-761773860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-761773860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-761773860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-761773860, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-761773860|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-761773860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-761773860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 19:09:46,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1921737903 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1921737903| ~y~0_In1921737903) .cse0) (and (= |ULTIMATE.start_main_#t~ite91_Out1921737903| ~y$mem_tmp~0_In1921737903) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1921737903, ~y$flush_delayed~0=~y$flush_delayed~0_In1921737903, ~y~0=~y~0_In1921737903} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1921737903, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1921737903|, ~y$flush_delayed~0=~y$flush_delayed~0_In1921737903, ~y~0=~y~0_In1921737903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 19:09:46,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:09:46,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:09:46 BasicIcfg [2019-12-07 19:09:46,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:09:46,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:09:46,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:09:46,783 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:09:46,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:09:17" (3/4) ... [2019-12-07 19:09:46,785 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:09:46,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1593~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22|)) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22|) |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_19|, ULTIMATE.start_main_~#t1593~0.offset=|v_ULTIMATE.start_main_~#t1593~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ULTIMATE.start_main_~#t1593~0.base=|v_ULTIMATE.start_main_~#t1593~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_~#t1594~0.offset, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1593~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1593~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:09:46,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1594~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1594~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10|) |v_ULTIMATE.start_main_~#t1594~0.offset_9| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1594~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1594~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 19:09:46,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 19:09:46,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-242264121 256) 0))) (or (and .cse0 (= ~y~0_In-242264121 |P1Thread1of1ForFork1_#t~ite31_Out-242264121|)) (and (= ~y$mem_tmp~0_In-242264121 |P1Thread1of1ForFork1_#t~ite31_Out-242264121|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-242264121, ~y$flush_delayed~0=~y$flush_delayed~0_In-242264121, ~y~0=~y~0_In-242264121} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-242264121, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-242264121|, ~y$flush_delayed~0=~y$flush_delayed~0_In-242264121, ~y~0=~y~0_In-242264121} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 19:09:46,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-824899813 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-824899813 |P1Thread1of1ForFork1_#t~ite54_Out-824899813|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-824899813| ~y~0_In-824899813)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-824899813, ~y$flush_delayed~0=~y$flush_delayed~0_In-824899813, ~y~0=~y~0_In-824899813} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-824899813, ~y$flush_delayed~0=~y$flush_delayed~0_In-824899813, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-824899813|, ~y~0=~y~0_In-824899813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 19:09:46,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1598184631 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1598184631 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1598184631 |P0Thread1of1ForFork0_#t~ite5_Out-1598184631|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1598184631| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598184631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1598184631} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1598184631|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598184631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1598184631} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:09:46,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In934338631 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In934338631 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In934338631 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In934338631 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out934338631|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In934338631 |P0Thread1of1ForFork0_#t~ite6_Out934338631|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In934338631, ~y$w_buff0_used~0=~y$w_buff0_used~0_In934338631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In934338631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934338631} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out934338631|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In934338631, ~y$w_buff0_used~0=~y$w_buff0_used~0_In934338631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In934338631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934338631} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:09:46,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-940365868 ~y$r_buff0_thd1~0_Out-940365868)) (.cse0 (= (mod ~y$w_buff0_used~0_In-940365868 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-940365868 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-940365868) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-940365868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-940365868} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-940365868, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-940365868|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-940365868} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:09:46,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-636098448 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-636098448 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-636098448 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-636098448 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-636098448|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-636098448 |P0Thread1of1ForFork0_#t~ite8_Out-636098448|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-636098448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-636098448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-636098448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636098448} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-636098448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-636098448, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-636098448|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-636098448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636098448} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:09:46,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:09:46,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In464416697 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In464416697 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out464416697| |P1Thread1of1ForFork1_#t~ite55_Out464416697|))) (or (and (= |P1Thread1of1ForFork1_#t~ite55_Out464416697| ~y$w_buff1~0_In464416697) (not .cse0) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite55_Out464416697| ~y~0_In464416697) (or .cse0 .cse2) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In464416697, ~y$w_buff1~0=~y$w_buff1~0_In464416697, ~y~0=~y~0_In464416697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464416697} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In464416697, ~y$w_buff1~0=~y$w_buff1~0_In464416697, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out464416697|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out464416697|, ~y~0=~y~0_In464416697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464416697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 19:09:46,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1080327115 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1080327115 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1080327115 |P1Thread1of1ForFork1_#t~ite57_Out-1080327115|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out-1080327115|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080327115, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080327115} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080327115, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080327115, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-1080327115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 19:09:46,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In244398961 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In244398961 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In244398961 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In244398961 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out244398961|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In244398961 |P1Thread1of1ForFork1_#t~ite58_Out244398961|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In244398961, ~y$w_buff0_used~0=~y$w_buff0_used~0_In244398961, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In244398961, ~y$w_buff1_used~0=~y$w_buff1_used~0_In244398961} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In244398961, ~y$w_buff0_used~0=~y$w_buff0_used~0_In244398961, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In244398961, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out244398961|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In244398961} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 19:09:46,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In607944385 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In607944385 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite59_Out607944385| ~y$r_buff0_thd2~0_In607944385)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite59_Out607944385| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In607944385, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In607944385} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In607944385, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In607944385, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out607944385|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 19:09:46,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1376752986 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1376752986 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1376752986 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1376752986 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out-1376752986| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1376752986 |P1Thread1of1ForFork1_#t~ite60_Out-1376752986|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1376752986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376752986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1376752986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1376752986} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1376752986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376752986, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1376752986|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1376752986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1376752986} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 19:09:46,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:09:46,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:09:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1787654659 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1787654659 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out1787654659| ~y$w_buff1~0_In1787654659) (not .cse1)) (and (= ~y~0_In1787654659 |ULTIMATE.start_main_#t~ite63_Out1787654659|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1787654659, ~y~0=~y~0_In1787654659, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1787654659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787654659} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1787654659|, ~y$w_buff1~0=~y$w_buff1~0_In1787654659, ~y~0=~y~0_In1787654659, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1787654659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787654659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 19:09:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 19:09:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In868360735 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In868360735 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out868360735| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite65_Out868360735| ~y$w_buff0_used~0_In868360735)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In868360735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In868360735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In868360735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In868360735, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out868360735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 19:09:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In15969883 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In15969883 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In15969883 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In15969883 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out15969883| ~y$w_buff1_used~0_In15969883)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite66_Out15969883| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In15969883, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15969883, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In15969883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In15969883} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In15969883, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15969883, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out15969883|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In15969883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In15969883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 19:09:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1888291573 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1888291573 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out1888291573|)) (and (= ~y$r_buff0_thd0~0_In1888291573 |ULTIMATE.start_main_#t~ite67_Out1888291573|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1888291573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1888291573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1888291573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1888291573, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1888291573|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 19:09:46,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-761773860 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-761773860 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-761773860 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-761773860 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-761773860|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-761773860 |ULTIMATE.start_main_#t~ite68_Out-761773860|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-761773860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-761773860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-761773860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-761773860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-761773860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-761773860, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-761773860|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-761773860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-761773860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 19:09:46,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1921737903 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1921737903| ~y~0_In1921737903) .cse0) (and (= |ULTIMATE.start_main_#t~ite91_Out1921737903| ~y$mem_tmp~0_In1921737903) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1921737903, ~y$flush_delayed~0=~y$flush_delayed~0_In1921737903, ~y~0=~y~0_In1921737903} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1921737903, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1921737903|, ~y$flush_delayed~0=~y$flush_delayed~0_In1921737903, ~y~0=~y~0_In1921737903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 19:09:46,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:09:46,869 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e15adf0-d0cb-4313-91f1-ad06fc1946e2/bin/utaipan/witness.graphml [2019-12-07 19:09:46,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:09:46,870 INFO L168 Benchmark]: Toolchain (without parser) took 30311.73 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 939.3 MB in the beginning and 1.6 GB in the end (delta: -670.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:46,870 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:09:46,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:46,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:09:46,871 INFO L168 Benchmark]: Boogie Preprocessor took 31.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:46,871 INFO L168 Benchmark]: RCFGBuilder took 527.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.0 MB in the end (delta: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:46,872 INFO L168 Benchmark]: TraceAbstraction took 29221.84 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 982.0 MB in the beginning and 1.6 GB in the end (delta: -667.9 MB). Peak memory consumption was 947.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:46,872 INFO L168 Benchmark]: Witness Printer took 85.78 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:46,873 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 527.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.0 MB in the end (delta: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29221.84 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 982.0 MB in the beginning and 1.6 GB in the end (delta: -667.9 MB). Peak memory consumption was 947.5 MB. Max. memory is 11.5 GB. * Witness Printer took 85.78 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 231 ProgramPointsBefore, 150 ProgramPointsAfterwards, 307 TransitionsBefore, 186 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 69 ConcurrentYvCompositions, 43 ChoiceCompositions, 14826 VarBasedMoverChecksPositive, 421 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 422 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 238871 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7172 SDtfs, 6378 SDslu, 25175 SDs, 0 SdLazy, 9555 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 47 SyntacticMatches, 12 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84490occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 30277 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1152 NumberOfCodeBlocks, 1152 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 421415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...