./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.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_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ad8f032ff12be1afa2818ff680df05f6b1cb629 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:21:04,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:21:04,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:21:04,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:21:04,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:21:04,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:21:04,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:21:04,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:21:04,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:21:04,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:21:04,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:21:04,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:21:04,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:21:04,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:21:04,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:21:04,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:21:04,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:21:04,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:21:04,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:21:04,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:21:04,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:21:04,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:21:04,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:21:04,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:21:04,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:21:04,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:21:04,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:21:04,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:21:04,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:21:04,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:21:04,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:21:04,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:21:04,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:21:04,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:21:04,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:21:04,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:21:04,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:21:04,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:21:04,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:21:04,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:21:04,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:21:04,993 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:21:05,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:21:05,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:21:05,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:21:05,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:21:05,007 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:21:05,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:21:05,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:21:05,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:21:05,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:21:05,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:21:05,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:21:05,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:21:05,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:21:05,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:21:05,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:21:05,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:21:05,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:21:05,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:21:05,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:21:05,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:21:05,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:21:05,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:05,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:21:05,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:21:05,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:21:05,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:21:05,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:21:05,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:21:05,012 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:21:05,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer 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 -> Automizer 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 -> 0ad8f032ff12be1afa2818ff680df05f6b1cb629 [2019-12-07 18:21:05,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:21:05,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:21:05,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:21:05,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:21:05,125 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:21:05,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i [2019-12-07 18:21:05,163 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/data/ebee394ea/f556fe5949e84faf8eab268ac5c54d74/FLAG9840a98da [2019-12-07 18:21:05,526 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:21:05,526 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i [2019-12-07 18:21:05,537 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/data/ebee394ea/f556fe5949e84faf8eab268ac5c54d74/FLAG9840a98da [2019-12-07 18:21:05,546 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/data/ebee394ea/f556fe5949e84faf8eab268ac5c54d74 [2019-12-07 18:21:05,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:21:05,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:21:05,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:05,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:21:05,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:21:05,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05, skipping insertion in model container [2019-12-07 18:21:05,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:21:05,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:21:05,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:05,846 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:21:05,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:05,938 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:21:05,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05 WrapperNode [2019-12-07 18:21:05,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:05,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:05,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:21:05,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:21:05,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:05,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:21:05,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:21:05,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:21:05,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:05,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:06,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:06,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:06,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... [2019-12-07 18:21:06,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:21:06,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:21:06,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:21:06,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:21:06,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/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 18:21:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:21:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:21:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:21:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:21:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:21:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:21:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:21:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:21:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:21:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:21:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:21:06,062 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:21:06,524 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:21:06,524 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:21:06,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:06 BoogieIcfgContainer [2019-12-07 18:21:06,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:21:06,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:21:06,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:21:06,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:21:06,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:21:05" (1/3) ... [2019-12-07 18:21:06,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726dc6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:06, skipping insertion in model container [2019-12-07 18:21:06,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:05" (2/3) ... [2019-12-07 18:21:06,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726dc6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:06, skipping insertion in model container [2019-12-07 18:21:06,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:06" (3/3) ... [2019-12-07 18:21:06,532 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc.i [2019-12-07 18:21:06,538 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:21:06,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:21:06,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:21:06,544 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:21:06,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:06,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:21:06,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:21:06,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:21:06,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:21:06,640 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:21:06,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:21:06,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:21:06,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:21:06,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:21:06,653 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-07 18:21:06,655 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 18:21:06,747 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 18:21:06,748 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:06,764 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 1198 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 18:21:06,805 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 18:21:06,863 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 18:21:06,863 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:06,876 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 1198 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 18:21:06,909 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-07 18:21:06,910 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:21:10,558 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 18:21:10,672 INFO L206 etLargeBlockEncoding]: Checked pairs total: 232725 [2019-12-07 18:21:10,672 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-07 18:21:10,674 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 184 transitions [2019-12-07 18:21:13,593 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 50078 states. [2019-12-07 18:21:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states. [2019-12-07 18:21:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 18:21:13,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:13,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 18:21:13,599 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1268502306, now seen corresponding path program 1 times [2019-12-07 18:21:13,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:13,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865073142] [2019-12-07 18:21:13,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:13,746 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 18:21:13,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865073142] [2019-12-07 18:21:13,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:13,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:21:13,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753125189] [2019-12-07 18:21:13,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:13,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:13,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:13,762 INFO L87 Difference]: Start difference. First operand 50078 states. Second operand 3 states. [2019-12-07 18:21:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:14,187 INFO L93 Difference]: Finished difference Result 50030 states and 178645 transitions. [2019-12-07 18:21:14,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:14,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 18:21:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:14,451 INFO L225 Difference]: With dead ends: 50030 [2019-12-07 18:21:14,452 INFO L226 Difference]: Without dead ends: 49055 [2019-12-07 18:21:14,453 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 18:21:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49055 states. [2019-12-07 18:21:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49055 to 49055. [2019-12-07 18:21:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49055 states. [2019-12-07 18:21:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49055 states to 49055 states and 175395 transitions. [2019-12-07 18:21:16,248 INFO L78 Accepts]: Start accepts. Automaton has 49055 states and 175395 transitions. Word has length 5 [2019-12-07 18:21:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:16,248 INFO L462 AbstractCegarLoop]: Abstraction has 49055 states and 175395 transitions. [2019-12-07 18:21:16,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 49055 states and 175395 transitions. [2019-12-07 18:21:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:21:16,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:16,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:16,251 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1198055303, now seen corresponding path program 1 times [2019-12-07 18:21:16,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:16,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832016821] [2019-12-07 18:21:16,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:16,330 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 18:21:16,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832016821] [2019-12-07 18:21:16,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:16,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:16,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18871259] [2019-12-07 18:21:16,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:16,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:16,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:16,332 INFO L87 Difference]: Start difference. First operand 49055 states and 175395 transitions. Second operand 4 states. [2019-12-07 18:21:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:16,803 INFO L93 Difference]: Finished difference Result 68649 states and 238459 transitions. [2019-12-07 18:21:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:16,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:21:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:17,001 INFO L225 Difference]: With dead ends: 68649 [2019-12-07 18:21:17,001 INFO L226 Difference]: Without dead ends: 68649 [2019-12-07 18:21:17,001 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 18:21:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68649 states. [2019-12-07 18:21:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68649 to 68283. [2019-12-07 18:21:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68283 states. [2019-12-07 18:21:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68283 states to 68283 states and 237431 transitions. [2019-12-07 18:21:19,071 INFO L78 Accepts]: Start accepts. Automaton has 68283 states and 237431 transitions. Word has length 11 [2019-12-07 18:21:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:19,071 INFO L462 AbstractCegarLoop]: Abstraction has 68283 states and 237431 transitions. [2019-12-07 18:21:19,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 68283 states and 237431 transitions. [2019-12-07 18:21:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:21:19,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:19,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:19,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2038106739, now seen corresponding path program 1 times [2019-12-07 18:21:19,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:19,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712686410] [2019-12-07 18:21:19,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:19,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 18:21:19,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712686410] [2019-12-07 18:21:19,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:19,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:19,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395536155] [2019-12-07 18:21:19,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:19,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:19,131 INFO L87 Difference]: Start difference. First operand 68283 states and 237431 transitions. Second operand 4 states. [2019-12-07 18:21:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:19,721 INFO L93 Difference]: Finished difference Result 99934 states and 337703 transitions. [2019-12-07 18:21:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:19,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:21:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:19,918 INFO L225 Difference]: With dead ends: 99934 [2019-12-07 18:21:19,918 INFO L226 Difference]: Without dead ends: 99927 [2019-12-07 18:21:19,918 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 18:21:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99927 states. [2019-12-07 18:21:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99927 to 88377. [2019-12-07 18:21:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88377 states. [2019-12-07 18:21:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88377 states to 88377 states and 301889 transitions. [2019-12-07 18:21:22,366 INFO L78 Accepts]: Start accepts. Automaton has 88377 states and 301889 transitions. Word has length 11 [2019-12-07 18:21:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:22,367 INFO L462 AbstractCegarLoop]: Abstraction has 88377 states and 301889 transitions. [2019-12-07 18:21:22,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 88377 states and 301889 transitions. [2019-12-07 18:21:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:21:22,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:22,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:22,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1380914162, now seen corresponding path program 1 times [2019-12-07 18:21:22,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:22,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086997216] [2019-12-07 18:21:22,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:21:23,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086997216] [2019-12-07 18:21:23,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:23,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:23,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622931549] [2019-12-07 18:21:23,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:23,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:23,606 INFO L87 Difference]: Start difference. First operand 88377 states and 301889 transitions. Second operand 5 states. [2019-12-07 18:21:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:24,499 INFO L93 Difference]: Finished difference Result 116955 states and 392443 transitions. [2019-12-07 18:21:24,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:21:24,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 18:21:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:24,723 INFO L225 Difference]: With dead ends: 116955 [2019-12-07 18:21:24,724 INFO L226 Difference]: Without dead ends: 116948 [2019-12-07 18:21:24,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:21:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116948 states. [2019-12-07 18:21:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116948 to 88545. [2019-12-07 18:21:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88545 states. [2019-12-07 18:21:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88545 states to 88545 states and 302245 transitions. [2019-12-07 18:21:27,195 INFO L78 Accepts]: Start accepts. Automaton has 88545 states and 302245 transitions. Word has length 17 [2019-12-07 18:21:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:27,195 INFO L462 AbstractCegarLoop]: Abstraction has 88545 states and 302245 transitions. [2019-12-07 18:21:27,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 88545 states and 302245 transitions. [2019-12-07 18:21:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:21:27,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:27,211 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] [2019-12-07 18:21:27,211 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:27,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1904906828, now seen corresponding path program 1 times [2019-12-07 18:21:27,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:27,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643888780] [2019-12-07 18:21:27,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:27,255 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 18:21:27,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643888780] [2019-12-07 18:21:27,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:27,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:27,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865810397] [2019-12-07 18:21:27,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:27,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:27,256 INFO L87 Difference]: Start difference. First operand 88545 states and 302245 transitions. Second operand 4 states. [2019-12-07 18:21:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:27,303 INFO L93 Difference]: Finished difference Result 9568 states and 24288 transitions. [2019-12-07 18:21:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:21:27,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 18:21:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:27,313 INFO L225 Difference]: With dead ends: 9568 [2019-12-07 18:21:27,313 INFO L226 Difference]: Without dead ends: 7980 [2019-12-07 18:21:27,313 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 18:21:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-07 18:21:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-07 18:21:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-07 18:21:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 19357 transitions. [2019-12-07 18:21:27,396 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 19357 transitions. Word has length 25 [2019-12-07 18:21:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:27,396 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 19357 transitions. [2019-12-07 18:21:27,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 19357 transitions. [2019-12-07 18:21:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:21:27,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:27,399 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] [2019-12-07 18:21:27,399 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 551296721, now seen corresponding path program 1 times [2019-12-07 18:21:27,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:27,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661640461] [2019-12-07 18:21:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:27,452 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 18:21:27,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661640461] [2019-12-07 18:21:27,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:27,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:21:27,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189772134] [2019-12-07 18:21:27,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:27,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:27,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:27,454 INFO L87 Difference]: Start difference. First operand 7980 states and 19357 transitions. Second operand 5 states. [2019-12-07 18:21:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:27,484 INFO L93 Difference]: Finished difference Result 1856 states and 4027 transitions. [2019-12-07 18:21:27,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:27,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 18:21:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:27,486 INFO L225 Difference]: With dead ends: 1856 [2019-12-07 18:21:27,486 INFO L226 Difference]: Without dead ends: 1686 [2019-12-07 18:21:27,486 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 18:21:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2019-12-07 18:21:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1616. [2019-12-07 18:21:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2019-12-07 18:21:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 3523 transitions. [2019-12-07 18:21:27,501 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 3523 transitions. Word has length 37 [2019-12-07 18:21:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:27,501 INFO L462 AbstractCegarLoop]: Abstraction has 1616 states and 3523 transitions. [2019-12-07 18:21:27,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 3523 transitions. [2019-12-07 18:21:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:21:27,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:27,505 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] [2019-12-07 18:21:27,505 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash -175598507, now seen corresponding path program 1 times [2019-12-07 18:21:27,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:27,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313730367] [2019-12-07 18:21:27,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:27,608 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 18:21:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313730367] [2019-12-07 18:21:27,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:27,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:21:27,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073478688] [2019-12-07 18:21:27,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:21:27,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:21:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:21:27,609 INFO L87 Difference]: Start difference. First operand 1616 states and 3523 transitions. Second operand 7 states. [2019-12-07 18:21:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:28,219 INFO L93 Difference]: Finished difference Result 2441 states and 5258 transitions. [2019-12-07 18:21:28,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:21:28,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-07 18:21:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:28,221 INFO L225 Difference]: With dead ends: 2441 [2019-12-07 18:21:28,221 INFO L226 Difference]: Without dead ends: 2441 [2019-12-07 18:21:28,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:21:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-12-07 18:21:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1898. [2019-12-07 18:21:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-12-07 18:21:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4144 transitions. [2019-12-07 18:21:28,237 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4144 transitions. Word has length 83 [2019-12-07 18:21:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:28,237 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 4144 transitions. [2019-12-07 18:21:28,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:21:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4144 transitions. [2019-12-07 18:21:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:21:28,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:28,239 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] [2019-12-07 18:21:28,239 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1827081641, now seen corresponding path program 2 times [2019-12-07 18:21:28,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:28,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900806834] [2019-12-07 18:21:28,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:28,331 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 18:21:28,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900806834] [2019-12-07 18:21:28,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:28,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:21:28,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124663588] [2019-12-07 18:21:28,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:21:28,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:21:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:28,332 INFO L87 Difference]: Start difference. First operand 1898 states and 4144 transitions. Second operand 6 states. [2019-12-07 18:21:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:28,826 INFO L93 Difference]: Finished difference Result 2323 states and 5011 transitions. [2019-12-07 18:21:28,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:21:28,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-07 18:21:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:28,828 INFO L225 Difference]: With dead ends: 2323 [2019-12-07 18:21:28,829 INFO L226 Difference]: Without dead ends: 2323 [2019-12-07 18:21:28,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 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 18:21:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-12-07 18:21:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2003. [2019-12-07 18:21:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-12-07 18:21:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 4360 transitions. [2019-12-07 18:21:28,845 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 4360 transitions. Word has length 83 [2019-12-07 18:21:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:28,845 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 4360 transitions. [2019-12-07 18:21:28,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:21:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 4360 transitions. [2019-12-07 18:21:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:21:28,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:28,847 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] [2019-12-07 18:21:28,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 219474423, now seen corresponding path program 3 times [2019-12-07 18:21:28,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:28,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887274352] [2019-12-07 18:21:28,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:28,912 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 18:21:28,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887274352] [2019-12-07 18:21:28,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:28,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:21:28,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372299356] [2019-12-07 18:21:28,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:28,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:28,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:28,914 INFO L87 Difference]: Start difference. First operand 2003 states and 4360 transitions. Second operand 5 states. [2019-12-07 18:21:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:29,108 INFO L93 Difference]: Finished difference Result 2156 states and 4640 transitions. [2019-12-07 18:21:29,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:21:29,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-07 18:21:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:29,110 INFO L225 Difference]: With dead ends: 2156 [2019-12-07 18:21:29,110 INFO L226 Difference]: Without dead ends: 2156 [2019-12-07 18:21:29,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-12-07 18:21:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2045. [2019-12-07 18:21:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-07 18:21:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4445 transitions. [2019-12-07 18:21:29,127 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4445 transitions. Word has length 83 [2019-12-07 18:21:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:29,127 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4445 transitions. [2019-12-07 18:21:29,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4445 transitions. [2019-12-07 18:21:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:21:29,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:29,129 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] [2019-12-07 18:21:29,129 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1940404291, now seen corresponding path program 4 times [2019-12-07 18:21:29,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:29,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803336134] [2019-12-07 18:21:29,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:29,300 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 18:21:29,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803336134] [2019-12-07 18:21:29,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:29,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:21:29,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269440858] [2019-12-07 18:21:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:21:29,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:21:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:21:29,301 INFO L87 Difference]: Start difference. First operand 2045 states and 4445 transitions. Second operand 10 states. [2019-12-07 18:21:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:30,039 INFO L93 Difference]: Finished difference Result 3563 states and 7629 transitions. [2019-12-07 18:21:30,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:21:30,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-07 18:21:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:30,042 INFO L225 Difference]: With dead ends: 3563 [2019-12-07 18:21:30,042 INFO L226 Difference]: Without dead ends: 3563 [2019-12-07 18:21:30,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:21:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-12-07 18:21:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2337. [2019-12-07 18:21:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-07 18:21:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 5075 transitions. [2019-12-07 18:21:30,064 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 5075 transitions. Word has length 83 [2019-12-07 18:21:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:30,065 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 5075 transitions. [2019-12-07 18:21:30,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:21:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 5075 transitions. [2019-12-07 18:21:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:21:30,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:30,068 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] [2019-12-07 18:21:30,068 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 22757597, now seen corresponding path program 5 times [2019-12-07 18:21:30,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:30,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617006150] [2019-12-07 18:21:30,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:30,127 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 18:21:30,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617006150] [2019-12-07 18:21:30,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:30,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:30,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844020227] [2019-12-07 18:21:30,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:30,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:30,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:30,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:30,129 INFO L87 Difference]: Start difference. First operand 2337 states and 5075 transitions. Second operand 3 states. [2019-12-07 18:21:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:30,158 INFO L93 Difference]: Finished difference Result 2336 states and 5073 transitions. [2019-12-07 18:21:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:30,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 18:21:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:30,161 INFO L225 Difference]: With dead ends: 2336 [2019-12-07 18:21:30,161 INFO L226 Difference]: Without dead ends: 2336 [2019-12-07 18:21:30,161 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 18:21:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-12-07 18:21:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2134. [2019-12-07 18:21:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-12-07 18:21:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 4679 transitions. [2019-12-07 18:21:30,189 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 4679 transitions. Word has length 83 [2019-12-07 18:21:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:30,189 INFO L462 AbstractCegarLoop]: Abstraction has 2134 states and 4679 transitions. [2019-12-07 18:21:30,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 4679 transitions. [2019-12-07 18:21:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:21:30,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:30,193 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] [2019-12-07 18:21:30,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 231726278, now seen corresponding path program 1 times [2019-12-07 18:21:30,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:30,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265493761] [2019-12-07 18:21:30,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:30,369 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 18:21:30,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265493761] [2019-12-07 18:21:30,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:30,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:21:30,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300129560] [2019-12-07 18:21:30,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:21:30,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:21:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:21:30,371 INFO L87 Difference]: Start difference. First operand 2134 states and 4679 transitions. Second operand 14 states. [2019-12-07 18:21:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:31,018 INFO L93 Difference]: Finished difference Result 3721 states and 8151 transitions. [2019-12-07 18:21:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:21:31,018 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 84 [2019-12-07 18:21:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:31,021 INFO L225 Difference]: With dead ends: 3721 [2019-12-07 18:21:31,021 INFO L226 Difference]: Without dead ends: 3617 [2019-12-07 18:21:31,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:21:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2019-12-07 18:21:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 2734. [2019-12-07 18:21:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2019-12-07 18:21:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 6044 transitions. [2019-12-07 18:21:31,047 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 6044 transitions. Word has length 84 [2019-12-07 18:21:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:31,047 INFO L462 AbstractCegarLoop]: Abstraction has 2734 states and 6044 transitions. [2019-12-07 18:21:31,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:21:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 6044 transitions. [2019-12-07 18:21:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:21:31,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:31,050 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] [2019-12-07 18:21:31,050 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 973648166, now seen corresponding path program 2 times [2019-12-07 18:21:31,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:31,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721316117] [2019-12-07 18:21:31,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:31,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 18:21:31,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721316117] [2019-12-07 18:21:31,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:31,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:21:31,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411672138] [2019-12-07 18:21:31,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:31,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:31,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:31,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:31,106 INFO L87 Difference]: Start difference. First operand 2734 states and 6044 transitions. Second operand 5 states. [2019-12-07 18:21:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:31,313 INFO L93 Difference]: Finished difference Result 4244 states and 9397 transitions. [2019-12-07 18:21:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:21:31,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-07 18:21:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:31,316 INFO L225 Difference]: With dead ends: 4244 [2019-12-07 18:21:31,316 INFO L226 Difference]: Without dead ends: 4244 [2019-12-07 18:21:31,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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 18:21:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2019-12-07 18:21:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 3492. [2019-12-07 18:21:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3492 states. [2019-12-07 18:21:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 7675 transitions. [2019-12-07 18:21:31,350 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 7675 transitions. Word has length 84 [2019-12-07 18:21:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:31,350 INFO L462 AbstractCegarLoop]: Abstraction has 3492 states and 7675 transitions. [2019-12-07 18:21:31,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 7675 transitions. [2019-12-07 18:21:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 18:21:31,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:31,354 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 18:21:31,354 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1156661757, now seen corresponding path program 1 times [2019-12-07 18:21:31,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:31,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13329230] [2019-12-07 18:21:31,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:31,582 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 18:21:31,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13329230] [2019-12-07 18:21:31,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:31,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 18:21:31,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264450718] [2019-12-07 18:21:31,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:21:31,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:21:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:21:31,583 INFO L87 Difference]: Start difference. First operand 3492 states and 7675 transitions. Second operand 18 states. [2019-12-07 18:21:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:32,839 INFO L93 Difference]: Finished difference Result 8384 states and 18442 transitions. [2019-12-07 18:21:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:21:32,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 85 [2019-12-07 18:21:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:32,855 INFO L225 Difference]: With dead ends: 8384 [2019-12-07 18:21:32,856 INFO L226 Difference]: Without dead ends: 8280 [2019-12-07 18:21:32,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:21:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2019-12-07 18:21:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 5478. [2019-12-07 18:21:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5478 states. [2019-12-07 18:21:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 12297 transitions. [2019-12-07 18:21:32,928 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 12297 transitions. Word has length 85 [2019-12-07 18:21:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:32,928 INFO L462 AbstractCegarLoop]: Abstraction has 5478 states and 12297 transitions. [2019-12-07 18:21:32,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:21:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 12297 transitions. [2019-12-07 18:21:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 18:21:32,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:32,934 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 18:21:32,934 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:32,934 INFO L82 PathProgramCache]: Analyzing trace with hash 806649645, now seen corresponding path program 1 times [2019-12-07 18:21:32,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:32,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185416145] [2019-12-07 18:21:32,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:33,011 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 18:21:33,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185416145] [2019-12-07 18:21:33,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:33,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:21:33,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311313574] [2019-12-07 18:21:33,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:21:33,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:21:33,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:33,012 INFO L87 Difference]: Start difference. First operand 5478 states and 12297 transitions. Second operand 6 states. [2019-12-07 18:21:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:33,216 INFO L93 Difference]: Finished difference Result 5722 states and 12711 transitions. [2019-12-07 18:21:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:21:33,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-07 18:21:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:33,220 INFO L225 Difference]: With dead ends: 5722 [2019-12-07 18:21:33,220 INFO L226 Difference]: Without dead ends: 5639 [2019-12-07 18:21:33,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2019-12-07 18:21:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5427. [2019-12-07 18:21:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5427 states. [2019-12-07 18:21:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 12180 transitions. [2019-12-07 18:21:33,267 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 12180 transitions. Word has length 86 [2019-12-07 18:21:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:33,267 INFO L462 AbstractCegarLoop]: Abstraction has 5427 states and 12180 transitions. [2019-12-07 18:21:33,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:21:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 12180 transitions. [2019-12-07 18:21:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 18:21:33,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:33,273 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 18:21:33,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1193349128, now seen corresponding path program 1 times [2019-12-07 18:21:33,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:33,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330446374] [2019-12-07 18:21:33,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:33,302 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 18:21:33,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330446374] [2019-12-07 18:21:33,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:33,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:33,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92697916] [2019-12-07 18:21:33,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:33,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:33,304 INFO L87 Difference]: Start difference. First operand 5427 states and 12180 transitions. Second operand 3 states. [2019-12-07 18:21:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:33,370 INFO L93 Difference]: Finished difference Result 6051 states and 12827 transitions. [2019-12-07 18:21:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:33,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 18:21:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:33,375 INFO L225 Difference]: With dead ends: 6051 [2019-12-07 18:21:33,375 INFO L226 Difference]: Without dead ends: 6051 [2019-12-07 18:21:33,375 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 18:21:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2019-12-07 18:21:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 5217. [2019-12-07 18:21:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5217 states. [2019-12-07 18:21:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 11239 transitions. [2019-12-07 18:21:33,430 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 11239 transitions. Word has length 86 [2019-12-07 18:21:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:33,431 INFO L462 AbstractCegarLoop]: Abstraction has 5217 states and 11239 transitions. [2019-12-07 18:21:33,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 11239 transitions. [2019-12-07 18:21:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 18:21:33,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:33,436 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 18:21:33,437 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -777091607, now seen corresponding path program 1 times [2019-12-07 18:21:33,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:33,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690016787] [2019-12-07 18:21:33,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:33,570 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 18:21:33,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690016787] [2019-12-07 18:21:33,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:33,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:21:33,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942518862] [2019-12-07 18:21:33,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:21:33,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:21:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:21:33,571 INFO L87 Difference]: Start difference. First operand 5217 states and 11239 transitions. Second operand 7 states. [2019-12-07 18:21:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:33,648 INFO L93 Difference]: Finished difference Result 5209 states and 11224 transitions. [2019-12-07 18:21:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:33,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-07 18:21:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:33,652 INFO L225 Difference]: With dead ends: 5209 [2019-12-07 18:21:33,652 INFO L226 Difference]: Without dead ends: 4638 [2019-12-07 18:21:33,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:21:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2019-12-07 18:21:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4210. [2019-12-07 18:21:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2019-12-07 18:21:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 9101 transitions. [2019-12-07 18:21:33,696 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 9101 transitions. Word has length 86 [2019-12-07 18:21:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:33,696 INFO L462 AbstractCegarLoop]: Abstraction has 4210 states and 9101 transitions. [2019-12-07 18:21:33,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:21:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 9101 transitions. [2019-12-07 18:21:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 18:21:33,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:33,701 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 18:21:33,701 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash -687415686, now seen corresponding path program 1 times [2019-12-07 18:21:33,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:33,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132289247] [2019-12-07 18:21:33,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:33,740 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 18:21:33,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132289247] [2019-12-07 18:21:33,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:33,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:33,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988404518] [2019-12-07 18:21:33,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:33,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:33,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:33,742 INFO L87 Difference]: Start difference. First operand 4210 states and 9101 transitions. Second operand 3 states. [2019-12-07 18:21:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:33,754 INFO L93 Difference]: Finished difference Result 3680 states and 7696 transitions. [2019-12-07 18:21:33,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:33,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 18:21:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:33,756 INFO L225 Difference]: With dead ends: 3680 [2019-12-07 18:21:33,757 INFO L226 Difference]: Without dead ends: 3680 [2019-12-07 18:21:33,757 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 18:21:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-12-07 18:21:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3660. [2019-12-07 18:21:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3660 states. [2019-12-07 18:21:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 7658 transitions. [2019-12-07 18:21:33,788 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 7658 transitions. Word has length 86 [2019-12-07 18:21:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:33,788 INFO L462 AbstractCegarLoop]: Abstraction has 3660 states and 7658 transitions. [2019-12-07 18:21:33,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 7658 transitions. [2019-12-07 18:21:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:21:33,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:33,792 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 18:21:33,792 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1973430413, now seen corresponding path program 1 times [2019-12-07 18:21:33,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:33,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076123640] [2019-12-07 18:21:33,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:33,906 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 18:21:33,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076123640] [2019-12-07 18:21:33,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:33,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:21:33,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257772940] [2019-12-07 18:21:33,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:21:33,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:33,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:21:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:21:33,907 INFO L87 Difference]: Start difference. First operand 3660 states and 7658 transitions. Second operand 7 states. [2019-12-07 18:21:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:34,238 INFO L93 Difference]: Finished difference Result 5218 states and 11051 transitions. [2019-12-07 18:21:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:21:34,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-12-07 18:21:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:34,242 INFO L225 Difference]: With dead ends: 5218 [2019-12-07 18:21:34,242 INFO L226 Difference]: Without dead ends: 5218 [2019-12-07 18:21:34,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:21:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2019-12-07 18:21:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 4326. [2019-12-07 18:21:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2019-12-07 18:21:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 9075 transitions. [2019-12-07 18:21:34,282 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 9075 transitions. Word has length 87 [2019-12-07 18:21:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:34,282 INFO L462 AbstractCegarLoop]: Abstraction has 4326 states and 9075 transitions. [2019-12-07 18:21:34,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:21:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 9075 transitions. [2019-12-07 18:21:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:21:34,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:34,286 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 18:21:34,287 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -168956201, now seen corresponding path program 2 times [2019-12-07 18:21:34,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:34,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588163919] [2019-12-07 18:21:34,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:34,435 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 18:21:34,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588163919] [2019-12-07 18:21:34,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:34,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:21:34,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831506774] [2019-12-07 18:21:34,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:21:34,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:21:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:34,437 INFO L87 Difference]: Start difference. First operand 4326 states and 9075 transitions. Second operand 8 states. [2019-12-07 18:21:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:35,146 INFO L93 Difference]: Finished difference Result 5824 states and 12124 transitions. [2019-12-07 18:21:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:21:35,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-12-07 18:21:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:35,154 INFO L225 Difference]: With dead ends: 5824 [2019-12-07 18:21:35,154 INFO L226 Difference]: Without dead ends: 5768 [2019-12-07 18:21:35,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:21:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2019-12-07 18:21:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 4156. [2019-12-07 18:21:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4156 states. [2019-12-07 18:21:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 8670 transitions. [2019-12-07 18:21:35,205 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 8670 transitions. Word has length 87 [2019-12-07 18:21:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:35,205 INFO L462 AbstractCegarLoop]: Abstraction has 4156 states and 8670 transitions. [2019-12-07 18:21:35,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:21:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 8670 transitions. [2019-12-07 18:21:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:21:35,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:35,210 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 18:21:35,210 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1151333618, now seen corresponding path program 1 times [2019-12-07 18:21:35,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:35,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822002243] [2019-12-07 18:21:35,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:35,486 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 18:21:35,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822002243] [2019-12-07 18:21:35,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:35,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 18:21:35,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811059180] [2019-12-07 18:21:35,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:21:35,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:21:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:21:35,487 INFO L87 Difference]: Start difference. First operand 4156 states and 8670 transitions. Second operand 15 states. [2019-12-07 18:21:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:38,621 INFO L93 Difference]: Finished difference Result 6938 states and 14460 transitions. [2019-12-07 18:21:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:21:38,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-12-07 18:21:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:38,631 INFO L225 Difference]: With dead ends: 6938 [2019-12-07 18:21:38,631 INFO L226 Difference]: Without dead ends: 6805 [2019-12-07 18:21:38,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:21:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2019-12-07 18:21:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 4407. [2019-12-07 18:21:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4407 states. [2019-12-07 18:21:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 9223 transitions. [2019-12-07 18:21:38,687 INFO L78 Accepts]: Start accepts. Automaton has 4407 states and 9223 transitions. Word has length 87 [2019-12-07 18:21:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:38,687 INFO L462 AbstractCegarLoop]: Abstraction has 4407 states and 9223 transitions. [2019-12-07 18:21:38,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:21:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4407 states and 9223 transitions. [2019-12-07 18:21:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:21:38,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:38,690 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 18:21:38,690 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:38,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash -910030344, now seen corresponding path program 2 times [2019-12-07 18:21:38,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:38,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874452559] [2019-12-07 18:21:38,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:38,964 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 18:21:38,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874452559] [2019-12-07 18:21:38,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:38,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:21:38,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315160150] [2019-12-07 18:21:38,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:21:38,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:21:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:21:38,965 INFO L87 Difference]: Start difference. First operand 4407 states and 9223 transitions. Second operand 14 states. [2019-12-07 18:21:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:40,158 INFO L93 Difference]: Finished difference Result 6864 states and 14330 transitions. [2019-12-07 18:21:40,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:21:40,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-12-07 18:21:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:40,163 INFO L225 Difference]: With dead ends: 6864 [2019-12-07 18:21:40,163 INFO L226 Difference]: Without dead ends: 6737 [2019-12-07 18:21:40,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:21:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6737 states. [2019-12-07 18:21:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6737 to 4499. [2019-12-07 18:21:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-12-07 18:21:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 9423 transitions. [2019-12-07 18:21:40,206 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 9423 transitions. Word has length 87 [2019-12-07 18:21:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:40,207 INFO L462 AbstractCegarLoop]: Abstraction has 4499 states and 9423 transitions. [2019-12-07 18:21:40,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:21:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 9423 transitions. [2019-12-07 18:21:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:21:40,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:40,209 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 18:21:40,209 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash -766393236, now seen corresponding path program 3 times [2019-12-07 18:21:40,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:40,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096386197] [2019-12-07 18:21:40,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:21:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:21:40,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:21:40,290 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:21:40,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~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_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~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_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~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_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #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, ~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_~#t1597~0.base, ~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, ULTIMATE.start_main_~#t1598~0.base, ~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_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:21:40,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-07 18:21:40,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_6|) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4 0)) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_6|)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_6|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_6|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-07 18:21:40,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-437898999 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-437898999 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-437898999 |P1Thread1of1ForFork1_#t~ite11_Out-437898999|)) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-437898999 |P1Thread1of1ForFork1_#t~ite11_Out-437898999|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-437898999, ~y$w_buff1~0=~y$w_buff1~0_In-437898999, ~y$w_buff0~0=~y$w_buff0~0_In-437898999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-437898999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-437898999, ~y$w_buff1~0=~y$w_buff1~0_In-437898999, ~y$w_buff0~0=~y$w_buff0~0_In-437898999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-437898999, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-437898999|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 18:21:40,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_11|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-07 18:21:40,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:21:40,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-159818954 256)))) (or (and .cse0 (= ~y~0_In-159818954 |P1Thread1of1ForFork1_#t~ite31_Out-159818954|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-159818954| ~y$mem_tmp~0_In-159818954) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-159818954, ~y$flush_delayed~0=~y$flush_delayed~0_In-159818954, ~y~0=~y~0_In-159818954} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-159818954, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-159818954|, ~y$flush_delayed~0=~y$flush_delayed~0_In-159818954, ~y~0=~y~0_In-159818954} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:21:40,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In428715417 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In428715417 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out428715417| |P0Thread1of1ForFork0_#t~ite3_Out428715417|))) (or (and (= ~y$w_buff1~0_In428715417 |P0Thread1of1ForFork0_#t~ite3_Out428715417|) (not .cse0) (not .cse1) .cse2) (and (= ~y~0_In428715417 |P0Thread1of1ForFork0_#t~ite3_Out428715417|) (or .cse0 .cse1) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In428715417, ~y$w_buff1~0=~y$w_buff1~0_In428715417, ~y~0=~y~0_In428715417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In428715417} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In428715417, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out428715417|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out428715417|, ~y$w_buff1~0=~y$w_buff1~0_In428715417, ~y~0=~y~0_In428715417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In428715417} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 18:21:40,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In301723342 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In301723342 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In301723342 |P1Thread1of1ForFork1_#t~ite34_Out301723342|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In301723342 |P1Thread1of1ForFork1_#t~ite34_Out301723342|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In301723342, ~y$w_buff1~0=~y$w_buff1~0_In301723342, ~y$w_buff0~0=~y$w_buff0~0_In301723342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In301723342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In301723342, ~y$w_buff1~0=~y$w_buff1~0_In301723342, ~y$w_buff0~0=~y$w_buff0~0_In301723342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In301723342, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out301723342|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:21:40,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_6|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_6|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_5|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_5|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-07 18:21:40,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_9|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_6|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 18:21:40,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1107115460 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1107115460| ~y$mem_tmp~0_In-1107115460) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-1107115460| ~y~0_In-1107115460)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1107115460, ~y$flush_delayed~0=~y$flush_delayed~0_In-1107115460, ~y~0=~y~0_In-1107115460} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1107115460, ~y$flush_delayed~0=~y$flush_delayed~0_In-1107115460, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1107115460|, ~y~0=~y~0_In-1107115460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 18:21:40,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2071070413 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2071070413 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2071070413| ~y$w_buff0_used~0_In2071070413) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2071070413| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2071070413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2071070413} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2071070413|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2071070413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2071070413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:21:40,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In176496093 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In176496093 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In176496093 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In176496093 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out176496093| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out176496093| ~y$w_buff1_used~0_In176496093)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In176496093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In176496093, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In176496093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In176496093} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out176496093|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In176496093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In176496093, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In176496093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In176496093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:21:40,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-876103160 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-876103160 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-876103160| ~y$r_buff0_thd1~0_In-876103160)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-876103160| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-876103160, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-876103160} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-876103160, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-876103160|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-876103160} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 18:21:40,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-765094227 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-765094227 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-765094227 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-765094227 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-765094227| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-765094227| ~y$r_buff1_thd1~0_In-765094227) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-765094227, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-765094227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-765094227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-765094227} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-765094227, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-765094227, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-765094227|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-765094227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-765094227} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:21:40,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_30|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} 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_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} 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 18:21:40,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-91971441 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-91971441 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-91971441| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-91971441 |P1Thread1of1ForFork1_#t~ite57_Out-91971441|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-91971441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-91971441} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-91971441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-91971441, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-91971441|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 18:21:40,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2035770819 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2035770819 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2035770819 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2035770819 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-2035770819|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite58_Out-2035770819| ~y$w_buff1_used~0_In-2035770819) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2035770819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035770819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2035770819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035770819} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2035770819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035770819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2035770819, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-2035770819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035770819} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 18:21:40,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-1589707834 ~y$r_buff0_thd2~0_In-1589707834)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1589707834 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1589707834 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out-1589707834) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589707834, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1589707834} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589707834, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1589707834, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-1589707834|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 18:21:40,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1779427020 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1779427020 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1779427020 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1779427020 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1779427020 |P1Thread1of1ForFork1_#t~ite60_Out-1779427020|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite60_Out-1779427020| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779427020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779427020, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779427020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779427020} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779427020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779427020, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1779427020|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779427020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779427020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 18:21:40,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, 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 18:21:40,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:21:40,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-55773638 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-55773638 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-55773638 |ULTIMATE.start_main_#t~ite63_Out-55773638|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-55773638 |ULTIMATE.start_main_#t~ite63_Out-55773638|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-55773638, ~y~0=~y~0_In-55773638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-55773638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55773638} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-55773638|, ~y$w_buff1~0=~y$w_buff1~0_In-55773638, ~y~0=~y~0_In-55773638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-55773638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55773638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:21:40,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:21:40,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1004709774 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1004709774 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out1004709774|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1004709774 |ULTIMATE.start_main_#t~ite65_Out1004709774|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1004709774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1004709774} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1004709774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1004709774, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1004709774|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:21:40,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1333270399 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1333270399 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1333270399 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1333270399 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out1333270399|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1333270399 |ULTIMATE.start_main_#t~ite66_Out1333270399|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1333270399, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1333270399, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1333270399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1333270399} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1333270399, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1333270399, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1333270399|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1333270399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1333270399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:21:40,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1313031456 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1313031456 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1313031456|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1313031456 |ULTIMATE.start_main_#t~ite67_Out-1313031456|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313031456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313031456} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313031456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313031456, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1313031456|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:21:40,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2146770967 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2146770967 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2146770967 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In2146770967 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out2146770967| ~y$r_buff1_thd0~0_In2146770967) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite68_Out2146770967| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2146770967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146770967, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2146770967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146770967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2146770967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146770967, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out2146770967|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2146770967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146770967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:21:40,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1976160448 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1976160448| ~y~0_In1976160448) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out1976160448| ~y$mem_tmp~0_In1976160448)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1976160448, ~y$flush_delayed~0=~y$flush_delayed~0_In1976160448, ~y~0=~y~0_In1976160448} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1976160448, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1976160448|, ~y$flush_delayed~0=~y$flush_delayed~0_In1976160448, ~y~0=~y~0_In1976160448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 18:21:40,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} 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 18:21:40,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:21:40 BasicIcfg [2019-12-07 18:21:40,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:21:40,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:21:40,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:21:40,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:21:40,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:06" (3/4) ... [2019-12-07 18:21:40,371 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:21:40,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~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_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~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_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~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_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #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, ~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_~#t1597~0.base, ~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, ULTIMATE.start_main_~#t1598~0.base, ~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_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:21:40,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-07 18:21:40,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_6|) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4 0)) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_6|)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_6|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_6|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-07 18:21:40,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-437898999 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-437898999 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-437898999 |P1Thread1of1ForFork1_#t~ite11_Out-437898999|)) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-437898999 |P1Thread1of1ForFork1_#t~ite11_Out-437898999|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-437898999, ~y$w_buff1~0=~y$w_buff1~0_In-437898999, ~y$w_buff0~0=~y$w_buff0~0_In-437898999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-437898999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-437898999, ~y$w_buff1~0=~y$w_buff1~0_In-437898999, ~y$w_buff0~0=~y$w_buff0~0_In-437898999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-437898999, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-437898999|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 18:21:40,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_11|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-07 18:21:40,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:21:40,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-159818954 256)))) (or (and .cse0 (= ~y~0_In-159818954 |P1Thread1of1ForFork1_#t~ite31_Out-159818954|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-159818954| ~y$mem_tmp~0_In-159818954) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-159818954, ~y$flush_delayed~0=~y$flush_delayed~0_In-159818954, ~y~0=~y~0_In-159818954} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-159818954, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-159818954|, ~y$flush_delayed~0=~y$flush_delayed~0_In-159818954, ~y~0=~y~0_In-159818954} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:21:40,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In428715417 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In428715417 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out428715417| |P0Thread1of1ForFork0_#t~ite3_Out428715417|))) (or (and (= ~y$w_buff1~0_In428715417 |P0Thread1of1ForFork0_#t~ite3_Out428715417|) (not .cse0) (not .cse1) .cse2) (and (= ~y~0_In428715417 |P0Thread1of1ForFork0_#t~ite3_Out428715417|) (or .cse0 .cse1) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In428715417, ~y$w_buff1~0=~y$w_buff1~0_In428715417, ~y~0=~y~0_In428715417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In428715417} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In428715417, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out428715417|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out428715417|, ~y$w_buff1~0=~y$w_buff1~0_In428715417, ~y~0=~y~0_In428715417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In428715417} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 18:21:40,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In301723342 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In301723342 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In301723342 |P1Thread1of1ForFork1_#t~ite34_Out301723342|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In301723342 |P1Thread1of1ForFork1_#t~ite34_Out301723342|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In301723342, ~y$w_buff1~0=~y$w_buff1~0_In301723342, ~y$w_buff0~0=~y$w_buff0~0_In301723342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In301723342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In301723342, ~y$w_buff1~0=~y$w_buff1~0_In301723342, ~y$w_buff0~0=~y$w_buff0~0_In301723342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In301723342, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out301723342|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:21:40,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_6|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_6|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_5|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_5|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-07 18:21:40,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_9|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_6|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 18:21:40,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1107115460 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1107115460| ~y$mem_tmp~0_In-1107115460) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-1107115460| ~y~0_In-1107115460)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1107115460, ~y$flush_delayed~0=~y$flush_delayed~0_In-1107115460, ~y~0=~y~0_In-1107115460} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1107115460, ~y$flush_delayed~0=~y$flush_delayed~0_In-1107115460, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1107115460|, ~y~0=~y~0_In-1107115460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 18:21:40,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2071070413 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2071070413 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2071070413| ~y$w_buff0_used~0_In2071070413) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2071070413| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2071070413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2071070413} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2071070413|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2071070413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2071070413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:21:40,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In176496093 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In176496093 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In176496093 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In176496093 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out176496093| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out176496093| ~y$w_buff1_used~0_In176496093)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In176496093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In176496093, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In176496093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In176496093} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out176496093|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In176496093, ~y$w_buff0_used~0=~y$w_buff0_used~0_In176496093, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In176496093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In176496093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:21:40,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-876103160 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-876103160 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-876103160| ~y$r_buff0_thd1~0_In-876103160)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-876103160| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-876103160, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-876103160} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-876103160, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-876103160|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-876103160} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-765094227 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-765094227 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-765094227 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-765094227 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-765094227| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-765094227| ~y$r_buff1_thd1~0_In-765094227) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-765094227, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-765094227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-765094227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-765094227} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-765094227, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-765094227, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-765094227|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-765094227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-765094227} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_30|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} 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_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} 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 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-91971441 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-91971441 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-91971441| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-91971441 |P1Thread1of1ForFork1_#t~ite57_Out-91971441|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-91971441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-91971441} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-91971441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-91971441, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-91971441|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2035770819 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2035770819 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2035770819 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2035770819 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-2035770819|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite58_Out-2035770819| ~y$w_buff1_used~0_In-2035770819) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2035770819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035770819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2035770819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035770819} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2035770819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2035770819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2035770819, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-2035770819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2035770819} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-1589707834 ~y$r_buff0_thd2~0_In-1589707834)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1589707834 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1589707834 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out-1589707834) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589707834, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1589707834} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589707834, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1589707834, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-1589707834|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1779427020 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1779427020 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1779427020 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1779427020 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1779427020 |P1Thread1of1ForFork1_#t~ite60_Out-1779427020|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite60_Out-1779427020| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779427020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779427020, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779427020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779427020} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779427020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779427020, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1779427020|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779427020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779427020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 18:21:40,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, 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 18:21:40,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:21:40,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-55773638 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-55773638 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-55773638 |ULTIMATE.start_main_#t~ite63_Out-55773638|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-55773638 |ULTIMATE.start_main_#t~ite63_Out-55773638|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-55773638, ~y~0=~y~0_In-55773638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-55773638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55773638} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-55773638|, ~y$w_buff1~0=~y$w_buff1~0_In-55773638, ~y~0=~y~0_In-55773638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-55773638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55773638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:21:40,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:21:40,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1004709774 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1004709774 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out1004709774|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1004709774 |ULTIMATE.start_main_#t~ite65_Out1004709774|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1004709774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1004709774} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1004709774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1004709774, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1004709774|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:21:40,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1333270399 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1333270399 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1333270399 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1333270399 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out1333270399|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1333270399 |ULTIMATE.start_main_#t~ite66_Out1333270399|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1333270399, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1333270399, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1333270399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1333270399} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1333270399, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1333270399, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1333270399|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1333270399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1333270399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:21:40,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1313031456 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1313031456 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1313031456|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1313031456 |ULTIMATE.start_main_#t~ite67_Out-1313031456|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313031456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313031456} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313031456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313031456, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1313031456|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:21:40,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2146770967 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2146770967 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2146770967 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In2146770967 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out2146770967| ~y$r_buff1_thd0~0_In2146770967) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite68_Out2146770967| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2146770967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146770967, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2146770967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146770967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2146770967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146770967, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out2146770967|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2146770967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146770967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:21:40,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1976160448 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1976160448| ~y~0_In1976160448) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out1976160448| ~y$mem_tmp~0_In1976160448)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1976160448, ~y$flush_delayed~0=~y$flush_delayed~0_In1976160448, ~y~0=~y~0_In1976160448} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1976160448, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1976160448|, ~y$flush_delayed~0=~y$flush_delayed~0_In1976160448, ~y~0=~y~0_In1976160448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 18:21:40,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} 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 18:21:40,447 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d870ed8e-d71f-4285-9547-c473f9727e84/bin/uautomizer/witness.graphml [2019-12-07 18:21:40,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:21:40,449 INFO L168 Benchmark]: Toolchain (without parser) took 34899.51 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 942.5 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:21:40,449 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:21:40,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -114.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:21:40,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.98 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 18:21:40,449 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 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 18:21:40,450 INFO L168 Benchmark]: RCFGBuilder took 510.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:21:40,450 INFO L168 Benchmark]: TraceAbstraction took 33842.44 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 979.4 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 18:21:40,450 INFO L168 Benchmark]: Witness Printer took 78.73 ms. Allocated memory is still 4.0 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:21:40,451 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -114.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 510.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33842.44 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 979.4 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 78.73 ms. Allocated memory is still 4.0 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 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, 147 ProgramPointsAfterwards, 307 TransitionsBefore, 184 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 42 ChoiceCompositions, 15276 VarBasedMoverChecksPositive, 410 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 446 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 232725 CheckedPairsTotal, 139 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(&t1597, ((void *)0), P0, ((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] [L815] FCALL, FORK 0 pthread_create(&t1598, ((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] [L724] 1 y = 2 [L727] 1 x = 1 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=0, weak$$choice2=0, x=1, y=2, 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] [L730] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 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 [__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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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)) [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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 [__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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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)) [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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=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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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) [L730] 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) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 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 [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [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 [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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 33.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6026 SDtfs, 6964 SDslu, 20908 SDs, 0 SdLazy, 11480 SolverSat, 381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 45 SyntacticMatches, 45 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88545occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 55862 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1553 NumberOfCodeBlocks, 1553 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1444 ConstructedInterpolants, 0 QuantifiedInterpolants, 513220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...