./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_tso.opt.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_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/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 2d6b2e8069af4598b0b4e83ccd284d21f82e991c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:35:03,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:35:03,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:35:03,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:35:03,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:35:03,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:35:03,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:35:03,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:35:03,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:35:03,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:35:03,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:35:03,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:35:03,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:35:03,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:35:03,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:35:03,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:35:03,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:35:03,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:35:03,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:35:03,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:35:03,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:35:03,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:35:03,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:35:03,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:35:03,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:35:03,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:35:03,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:35:03,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:35:03,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:35:03,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:35:03,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:35:03,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:35:03,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:35:03,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:35:03,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:35:03,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:35:03,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:35:03,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:35:03,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:35:03,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:35:03,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:35:03,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:35:03,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:35:03,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:35:03,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:35:03,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:35:03,929 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:35:03,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:35:03,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:35:03,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:35:03,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:35:03,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:35:03,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:35:03,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:35:03,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:35:03,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:35:03,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:35:03,930 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:35:03,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:35:03,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:35:03,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:35:03,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:35:03,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:35:03,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:35:03,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:35:03,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:35:03,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:35:03,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:35:03,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:35:03,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:35:03,932 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:35:03,932 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_becc3302-1868-4af3-b6ff-a810084f5054/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 -> 2d6b2e8069af4598b0b4e83ccd284d21f82e991c [2019-12-07 14:35:04,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:35:04,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:35:04,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:35:04,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:35:04,051 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:35:04,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix015_tso.opt.i [2019-12-07 14:35:04,088 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/data/b0d2827ac/a2a48227df754a50b7cbfaeee91dd752/FLAGd33ceaac5 [2019-12-07 14:35:04,567 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:35:04,567 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/sv-benchmarks/c/pthread-wmm/mix015_tso.opt.i [2019-12-07 14:35:04,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/data/b0d2827ac/a2a48227df754a50b7cbfaeee91dd752/FLAGd33ceaac5 [2019-12-07 14:35:04,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/data/b0d2827ac/a2a48227df754a50b7cbfaeee91dd752 [2019-12-07 14:35:04,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:35:04,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:35:04,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:35:04,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:35:04,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:35:04,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:04,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04, skipping insertion in model container [2019-12-07 14:35:04,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:04,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:35:04,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:35:04,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:35:04,904 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:35:04,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:35:04,992 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:35:04,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04 WrapperNode [2019-12-07 14:35:04,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:35:04,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:35:04,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:35:04,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:35:04,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:35:05,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:35:05,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:35:05,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:35:05,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... [2019-12-07 14:35:05,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:35:05,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:35:05,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:35:05,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:35:05,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/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 14:35:05,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:35:05,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:35:05,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:35:05,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:35:05,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:35:05,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:35:05,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:35:05,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:35:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:35:05,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:35:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:35:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:35:05,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:35:05,106 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 14:35:05,494 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:35:05,495 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:35:05,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:35:05 BoogieIcfgContainer [2019-12-07 14:35:05,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:35:05,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:35:05,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:35:05,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:35:05,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:35:04" (1/3) ... [2019-12-07 14:35:05,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528d42fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:35:05, skipping insertion in model container [2019-12-07 14:35:05,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:04" (2/3) ... [2019-12-07 14:35:05,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528d42fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:35:05, skipping insertion in model container [2019-12-07 14:35:05,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:35:05" (3/3) ... [2019-12-07 14:35:05,500 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_tso.opt.i [2019-12-07 14:35:05,506 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:35:05,506 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:35:05,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:35:05,512 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:35:05,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:05,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:35:05,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:35:05,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:35:05,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:35:05,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:35:05,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:35:05,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:35:05,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:35:05,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:35:05,600 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 14:35:05,601 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 14:35:05,663 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 14:35:05,663 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:35:05,677 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 922 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 14:35:05,702 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 14:35:05,749 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 14:35:05,749 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:35:05,757 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 922 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 14:35:05,781 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 14:35:05,782 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:35:09,112 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 14:35:09,367 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 14:35:09,468 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124397 [2019-12-07 14:35:09,469 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 14:35:09,471 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 14:35:12,270 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 14:35:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 14:35:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:35:12,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:12,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:12,277 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash -615654133, now seen corresponding path program 1 times [2019-12-07 14:35:12,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:12,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606467386] [2019-12-07 14:35:12,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:12,436 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 14:35:12,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606467386] [2019-12-07 14:35:12,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:12,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:35:12,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440722069] [2019-12-07 14:35:12,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:35:12,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:12,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:35:12,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:35:12,450 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 14:35:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:12,808 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 14:35:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:35:12,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 14:35:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:13,055 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 14:35:13,055 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 14:35:13,056 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 14:35:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 14:35:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 14:35:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 14:35:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 14:35:14,621 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 14:35:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:14,622 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 14:35:14,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:35:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 14:35:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:35:14,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:14,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:14,627 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -42181455, now seen corresponding path program 1 times [2019-12-07 14:35:14,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:14,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572758868] [2019-12-07 14:35:14,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:14,692 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 14:35:14,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572758868] [2019-12-07 14:35:14,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:14,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:35:14,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260397076] [2019-12-07 14:35:14,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:35:14,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:35:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:35:14,694 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 14:35:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:14,935 INFO L93 Difference]: Finished difference Result 26491 states and 94929 transitions. [2019-12-07 14:35:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:35:14,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:35:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:15,030 INFO L225 Difference]: With dead ends: 26491 [2019-12-07 14:35:15,030 INFO L226 Difference]: Without dead ends: 23431 [2019-12-07 14:35:15,031 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 14:35:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2019-12-07 14:35:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 23431. [2019-12-07 14:35:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23431 states. [2019-12-07 14:35:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23431 states to 23431 states and 83897 transitions. [2019-12-07 14:35:15,581 INFO L78 Accepts]: Start accepts. Automaton has 23431 states and 83897 transitions. Word has length 13 [2019-12-07 14:35:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:15,581 INFO L462 AbstractCegarLoop]: Abstraction has 23431 states and 83897 transitions. [2019-12-07 14:35:15,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:35:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 23431 states and 83897 transitions. [2019-12-07 14:35:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:35:15,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:15,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:15,584 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:15,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1080804847, now seen corresponding path program 1 times [2019-12-07 14:35:15,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:15,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433667989] [2019-12-07 14:35:15,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:15,640 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 14:35:15,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433667989] [2019-12-07 14:35:15,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:15,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:35:15,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75177617] [2019-12-07 14:35:15,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:35:15,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:35:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:35:15,641 INFO L87 Difference]: Start difference. First operand 23431 states and 83897 transitions. Second operand 5 states. [2019-12-07 14:35:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:15,699 INFO L93 Difference]: Finished difference Result 5977 states and 18478 transitions. [2019-12-07 14:35:15,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:35:15,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:35:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:15,707 INFO L225 Difference]: With dead ends: 5977 [2019-12-07 14:35:15,708 INFO L226 Difference]: Without dead ends: 4369 [2019-12-07 14:35:15,708 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 14:35:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2019-12-07 14:35:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4324. [2019-12-07 14:35:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4324 states. [2019-12-07 14:35:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 12670 transitions. [2019-12-07 14:35:15,781 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 12670 transitions. Word has length 14 [2019-12-07 14:35:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:15,781 INFO L462 AbstractCegarLoop]: Abstraction has 4324 states and 12670 transitions. [2019-12-07 14:35:15,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:35:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 12670 transitions. [2019-12-07 14:35:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:35:15,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:15,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:15,783 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash -902377345, now seen corresponding path program 1 times [2019-12-07 14:35:15,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:15,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911052064] [2019-12-07 14:35:15,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:15,836 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 14:35:15,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911052064] [2019-12-07 14:35:15,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:15,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:35:15,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548008417] [2019-12-07 14:35:15,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:35:15,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:35:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:35:15,837 INFO L87 Difference]: Start difference. First operand 4324 states and 12670 transitions. Second operand 4 states. [2019-12-07 14:35:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:16,059 INFO L93 Difference]: Finished difference Result 5896 states and 16778 transitions. [2019-12-07 14:35:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:35:16,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 14:35:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:16,065 INFO L225 Difference]: With dead ends: 5896 [2019-12-07 14:35:16,065 INFO L226 Difference]: Without dead ends: 5844 [2019-12-07 14:35:16,066 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 14:35:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2019-12-07 14:35:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5748. [2019-12-07 14:35:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5748 states. [2019-12-07 14:35:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 16462 transitions. [2019-12-07 14:35:16,134 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 16462 transitions. Word has length 16 [2019-12-07 14:35:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:16,135 INFO L462 AbstractCegarLoop]: Abstraction has 5748 states and 16462 transitions. [2019-12-07 14:35:16,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:35:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 16462 transitions. [2019-12-07 14:35:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:35:16,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:16,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:16,141 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 788566727, now seen corresponding path program 1 times [2019-12-07 14:35:16,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:16,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160584862] [2019-12-07 14:35:16,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:16,206 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 14:35:16,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160584862] [2019-12-07 14:35:16,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:16,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:35:16,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447136444] [2019-12-07 14:35:16,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:35:16,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:16,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:35:16,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:35:16,208 INFO L87 Difference]: Start difference. First operand 5748 states and 16462 transitions. Second operand 6 states. [2019-12-07 14:35:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:16,262 INFO L93 Difference]: Finished difference Result 4634 states and 13762 transitions. [2019-12-07 14:35:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:35:16,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 14:35:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:16,271 INFO L225 Difference]: With dead ends: 4634 [2019-12-07 14:35:16,271 INFO L226 Difference]: Without dead ends: 4495 [2019-12-07 14:35:16,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:35:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2019-12-07 14:35:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4439. [2019-12-07 14:35:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-12-07 14:35:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 13327 transitions. [2019-12-07 14:35:16,328 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 13327 transitions. Word has length 31 [2019-12-07 14:35:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:16,328 INFO L462 AbstractCegarLoop]: Abstraction has 4439 states and 13327 transitions. [2019-12-07 14:35:16,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:35:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 13327 transitions. [2019-12-07 14:35:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 14:35:16,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:16,340 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] [2019-12-07 14:35:16,340 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:16,340 INFO L82 PathProgramCache]: Analyzing trace with hash 97552975, now seen corresponding path program 1 times [2019-12-07 14:35:16,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:16,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368962063] [2019-12-07 14:35:16,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:16,416 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 14:35:16,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368962063] [2019-12-07 14:35:16,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:16,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:35:16,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218547674] [2019-12-07 14:35:16,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:35:16,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:35:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:35:16,417 INFO L87 Difference]: Start difference. First operand 4439 states and 13327 transitions. Second operand 6 states. [2019-12-07 14:35:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:16,797 INFO L93 Difference]: Finished difference Result 5198 states and 15270 transitions. [2019-12-07 14:35:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:35:16,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 14:35:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:16,805 INFO L225 Difference]: With dead ends: 5198 [2019-12-07 14:35:16,805 INFO L226 Difference]: Without dead ends: 5198 [2019-12-07 14:35:16,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:35:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2019-12-07 14:35:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 4891. [2019-12-07 14:35:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2019-12-07 14:35:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 14527 transitions. [2019-12-07 14:35:16,865 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 14527 transitions. Word has length 61 [2019-12-07 14:35:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:16,865 INFO L462 AbstractCegarLoop]: Abstraction has 4891 states and 14527 transitions. [2019-12-07 14:35:16,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:35:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 14527 transitions. [2019-12-07 14:35:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 14:35:16,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:16,872 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] [2019-12-07 14:35:16,872 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1532974713, now seen corresponding path program 2 times [2019-12-07 14:35:16,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:16,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669599688] [2019-12-07 14:35:16,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:16,945 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 14:35:16,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669599688] [2019-12-07 14:35:16,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:16,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:35:16,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834575993] [2019-12-07 14:35:16,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:35:16,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:35:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:35:16,947 INFO L87 Difference]: Start difference. First operand 4891 states and 14527 transitions. Second operand 6 states. [2019-12-07 14:35:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:17,088 INFO L93 Difference]: Finished difference Result 11949 states and 35200 transitions. [2019-12-07 14:35:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:35:17,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 14:35:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:17,099 INFO L225 Difference]: With dead ends: 11949 [2019-12-07 14:35:17,099 INFO L226 Difference]: Without dead ends: 8971 [2019-12-07 14:35:17,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:35:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2019-12-07 14:35:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7579. [2019-12-07 14:35:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7579 states. [2019-12-07 14:35:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 22975 transitions. [2019-12-07 14:35:17,197 INFO L78 Accepts]: Start accepts. Automaton has 7579 states and 22975 transitions. Word has length 61 [2019-12-07 14:35:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:17,198 INFO L462 AbstractCegarLoop]: Abstraction has 7579 states and 22975 transitions. [2019-12-07 14:35:17,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:35:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7579 states and 22975 transitions. [2019-12-07 14:35:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:35:17,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:17,208 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] [2019-12-07 14:35:17,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash 810923607, now seen corresponding path program 1 times [2019-12-07 14:35:17,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:17,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484293409] [2019-12-07 14:35:17,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:17,459 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 14:35:17,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484293409] [2019-12-07 14:35:17,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:17,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:35:17,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407999835] [2019-12-07 14:35:17,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:35:17,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:35:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:35:17,460 INFO L87 Difference]: Start difference. First operand 7579 states and 22975 transitions. Second operand 10 states. [2019-12-07 14:35:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:18,431 INFO L93 Difference]: Finished difference Result 17203 states and 47061 transitions. [2019-12-07 14:35:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:35:18,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 14:35:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:18,435 INFO L225 Difference]: With dead ends: 17203 [2019-12-07 14:35:18,435 INFO L226 Difference]: Without dead ends: 3883 [2019-12-07 14:35:18,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:35:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2019-12-07 14:35:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2019-12-07 14:35:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3883 states. [2019-12-07 14:35:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 9799 transitions. [2019-12-07 14:35:18,469 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 9799 transitions. Word has length 62 [2019-12-07 14:35:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:18,469 INFO L462 AbstractCegarLoop]: Abstraction has 3883 states and 9799 transitions. [2019-12-07 14:35:18,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:35:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 9799 transitions. [2019-12-07 14:35:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:35:18,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:18,474 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] [2019-12-07 14:35:18,474 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash -591850251, now seen corresponding path program 2 times [2019-12-07 14:35:18,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:18,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361333305] [2019-12-07 14:35:18,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:18,709 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 14:35:18,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361333305] [2019-12-07 14:35:18,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:18,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:35:18,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668629238] [2019-12-07 14:35:18,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:35:18,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:35:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:35:18,710 INFO L87 Difference]: Start difference. First operand 3883 states and 9799 transitions. Second operand 9 states. [2019-12-07 14:35:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:19,432 INFO L93 Difference]: Finished difference Result 8192 states and 20323 transitions. [2019-12-07 14:35:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:35:19,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 14:35:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:19,436 INFO L225 Difference]: With dead ends: 8192 [2019-12-07 14:35:19,436 INFO L226 Difference]: Without dead ends: 5620 [2019-12-07 14:35:19,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:35:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2019-12-07 14:35:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 3956. [2019-12-07 14:35:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3956 states. [2019-12-07 14:35:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 9957 transitions. [2019-12-07 14:35:19,483 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 9957 transitions. Word has length 62 [2019-12-07 14:35:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:19,483 INFO L462 AbstractCegarLoop]: Abstraction has 3956 states and 9957 transitions. [2019-12-07 14:35:19,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:35:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 9957 transitions. [2019-12-07 14:35:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:35:19,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:19,487 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] [2019-12-07 14:35:19,487 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1777892639, now seen corresponding path program 1 times [2019-12-07 14:35:19,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:19,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280218877] [2019-12-07 14:35:19,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:19,558 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 14:35:19,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280218877] [2019-12-07 14:35:19,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:19,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:35:19,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989670123] [2019-12-07 14:35:19,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:35:19,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:35:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:35:19,559 INFO L87 Difference]: Start difference. First operand 3956 states and 9957 transitions. Second operand 7 states. [2019-12-07 14:35:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:19,730 INFO L93 Difference]: Finished difference Result 8113 states and 20008 transitions. [2019-12-07 14:35:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:35:19,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 14:35:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:19,736 INFO L225 Difference]: With dead ends: 8113 [2019-12-07 14:35:19,736 INFO L226 Difference]: Without dead ends: 7311 [2019-12-07 14:35:19,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:35:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2019-12-07 14:35:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 6056. [2019-12-07 14:35:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 14:35:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 15550 transitions. [2019-12-07 14:35:19,806 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 15550 transitions. Word has length 62 [2019-12-07 14:35:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:19,807 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 15550 transitions. [2019-12-07 14:35:19,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:35:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 15550 transitions. [2019-12-07 14:35:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:35:19,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:19,814 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] [2019-12-07 14:35:19,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1839152335, now seen corresponding path program 2 times [2019-12-07 14:35:19,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:19,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601605166] [2019-12-07 14:35:19,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:19,951 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 14:35:19,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601605166] [2019-12-07 14:35:19,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:19,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:35:19,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175793896] [2019-12-07 14:35:19,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:35:19,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:35:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:35:19,952 INFO L87 Difference]: Start difference. First operand 6056 states and 15550 transitions. Second operand 10 states. [2019-12-07 14:35:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:20,759 INFO L93 Difference]: Finished difference Result 10292 states and 25892 transitions. [2019-12-07 14:35:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:35:20,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 14:35:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:20,769 INFO L225 Difference]: With dead ends: 10292 [2019-12-07 14:35:20,769 INFO L226 Difference]: Without dead ends: 10292 [2019-12-07 14:35:20,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:35:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10292 states. [2019-12-07 14:35:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10292 to 8032. [2019-12-07 14:35:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2019-12-07 14:35:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 20395 transitions. [2019-12-07 14:35:20,881 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 20395 transitions. Word has length 62 [2019-12-07 14:35:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:20,881 INFO L462 AbstractCegarLoop]: Abstraction has 8032 states and 20395 transitions. [2019-12-07 14:35:20,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:35:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 20395 transitions. [2019-12-07 14:35:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:35:20,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:20,890 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] [2019-12-07 14:35:20,890 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash -165683449, now seen corresponding path program 3 times [2019-12-07 14:35:20,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:20,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063739372] [2019-12-07 14:35:20,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:20,962 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 14:35:20,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063739372] [2019-12-07 14:35:20,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:20,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:35:20,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223932059] [2019-12-07 14:35:20,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:35:20,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:20,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:35:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:35:20,963 INFO L87 Difference]: Start difference. First operand 8032 states and 20395 transitions. Second operand 8 states. [2019-12-07 14:35:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:21,193 INFO L93 Difference]: Finished difference Result 12382 states and 30984 transitions. [2019-12-07 14:35:21,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:35:21,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-07 14:35:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:21,203 INFO L225 Difference]: With dead ends: 12382 [2019-12-07 14:35:21,204 INFO L226 Difference]: Without dead ends: 11993 [2019-12-07 14:35:21,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:35:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2019-12-07 14:35:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 8395. [2019-12-07 14:35:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8395 states. [2019-12-07 14:35:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8395 states to 8395 states and 21326 transitions. [2019-12-07 14:35:21,317 INFO L78 Accepts]: Start accepts. Automaton has 8395 states and 21326 transitions. Word has length 62 [2019-12-07 14:35:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:21,317 INFO L462 AbstractCegarLoop]: Abstraction has 8395 states and 21326 transitions. [2019-12-07 14:35:21,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:35:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 8395 states and 21326 transitions. [2019-12-07 14:35:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:35:21,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:21,328 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] [2019-12-07 14:35:21,328 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash -879441227, now seen corresponding path program 4 times [2019-12-07 14:35:21,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:21,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294596791] [2019-12-07 14:35:21,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:21,361 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 14:35:21,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294596791] [2019-12-07 14:35:21,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:21,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:35:21,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866479588] [2019-12-07 14:35:21,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:35:21,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:35:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:35:21,362 INFO L87 Difference]: Start difference. First operand 8395 states and 21326 transitions. Second operand 3 states. [2019-12-07 14:35:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:21,392 INFO L93 Difference]: Finished difference Result 8395 states and 21325 transitions. [2019-12-07 14:35:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:35:21,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 14:35:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:21,403 INFO L225 Difference]: With dead ends: 8395 [2019-12-07 14:35:21,403 INFO L226 Difference]: Without dead ends: 8395 [2019-12-07 14:35:21,403 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 14:35:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2019-12-07 14:35:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 8173. [2019-12-07 14:35:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8173 states. [2019-12-07 14:35:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8173 states to 8173 states and 20837 transitions. [2019-12-07 14:35:21,490 INFO L78 Accepts]: Start accepts. Automaton has 8173 states and 20837 transitions. Word has length 62 [2019-12-07 14:35:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:21,491 INFO L462 AbstractCegarLoop]: Abstraction has 8173 states and 20837 transitions. [2019-12-07 14:35:21,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:35:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8173 states and 20837 transitions. [2019-12-07 14:35:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:35:21,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:21,500 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] [2019-12-07 14:35:21,500 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 545668213, now seen corresponding path program 1 times [2019-12-07 14:35:21,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:21,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187448219] [2019-12-07 14:35:21,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:21,561 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 14:35:21,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187448219] [2019-12-07 14:35:21,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:35:21,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100909826] [2019-12-07 14:35:21,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:35:21,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:35:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:35:21,563 INFO L87 Difference]: Start difference. First operand 8173 states and 20837 transitions. Second operand 5 states. [2019-12-07 14:35:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:21,602 INFO L93 Difference]: Finished difference Result 8998 states and 22744 transitions. [2019-12-07 14:35:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:35:21,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 14:35:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:21,603 INFO L225 Difference]: With dead ends: 8998 [2019-12-07 14:35:21,603 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 14:35:21,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:35:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 14:35:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2019-12-07 14:35:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-07 14:35:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2097 transitions. [2019-12-07 14:35:21,611 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 2097 transitions. Word has length 63 [2019-12-07 14:35:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:21,612 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 2097 transitions. [2019-12-07 14:35:21,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:35:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 2097 transitions. [2019-12-07 14:35:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:35:21,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:21,613 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] [2019-12-07 14:35:21,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:21,613 INFO L82 PathProgramCache]: Analyzing trace with hash -692797329, now seen corresponding path program 2 times [2019-12-07 14:35:21,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:21,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115750745] [2019-12-07 14:35:21,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:21,684 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 14:35:21,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115750745] [2019-12-07 14:35:21,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:21,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:35:21,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373592869] [2019-12-07 14:35:21,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:35:21,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:35:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:35:21,685 INFO L87 Difference]: Start difference. First operand 957 states and 2097 transitions. Second operand 8 states. [2019-12-07 14:35:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:21,852 INFO L93 Difference]: Finished difference Result 1567 states and 3358 transitions. [2019-12-07 14:35:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:35:21,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 14:35:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:21,853 INFO L225 Difference]: With dead ends: 1567 [2019-12-07 14:35:21,853 INFO L226 Difference]: Without dead ends: 1199 [2019-12-07 14:35:21,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:35:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-12-07 14:35:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 966. [2019-12-07 14:35:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-12-07 14:35:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2112 transitions. [2019-12-07 14:35:21,863 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2112 transitions. Word has length 63 [2019-12-07 14:35:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:21,863 INFO L462 AbstractCegarLoop]: Abstraction has 966 states and 2112 transitions. [2019-12-07 14:35:21,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:35:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2112 transitions. [2019-12-07 14:35:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:35:21,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:21,864 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] [2019-12-07 14:35:21,864 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1081093091, now seen corresponding path program 3 times [2019-12-07 14:35:21,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:21,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055032336] [2019-12-07 14:35:21,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:35:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:35:21,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:35:21,958 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:35:21,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t406~0.base_114|) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t406~0.base_114| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114| 1) |v_#valid_146|) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= 0 |v_ULTIMATE.start_main_~#t406~0.offset_64|) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114|) |v_ULTIMATE.start_main_~#t406~0.offset_64| 0))) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_63|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_38|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_38|, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t406~0.offset=|v_ULTIMATE.start_main_~#t406~0.offset_64|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_87|, ULTIMATE.start_main_~#t406~0.base=|v_ULTIMATE.start_main_~#t406~0.base_114|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t408~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t408~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t407~0.offset, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t406~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t407~0.base, ULTIMATE.start_main_~#t406~0.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:35:21,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t407~0.base_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t407~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11|) |v_ULTIMATE.start_main_~#t407~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t407~0.base_11| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t407~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_10|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t407~0.offset, ULTIMATE.start_main_~#t407~0.base] because there is no mapped edge [2019-12-07 14:35:21,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11|) |v_ULTIMATE.start_main_~#t408~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t408~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t408~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t408~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t408~0.base_11| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t408~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t408~0.offset, #length] because there is no mapped edge [2019-12-07 14:35:21,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_200 256) 0)) (not (= (mod v_~z$w_buff0_used~0_347 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= v_~z$w_buff0~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 14:35:21,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-402712398 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-402712398 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff0~0_In-402712398 |P2Thread1of1ForFork0_#t~ite28_Out-402712398|)) (and (= ~z$w_buff1~0_In-402712398 |P2Thread1of1ForFork0_#t~ite28_Out-402712398|) (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-402712398, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-402712398, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-402712398, ~z$w_buff1~0=~z$w_buff1~0_In-402712398} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-402712398|, ~z$w_buff0~0=~z$w_buff0~0_In-402712398, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-402712398, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-402712398, ~z$w_buff1~0=~z$w_buff1~0_In-402712398} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:35:21,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:35:21,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 14:35:21,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-9938103 256)))) (or (and (= ~z~0_In-9938103 |P2Thread1of1ForFork0_#t~ite48_Out-9938103|) .cse0) (and (= ~z$mem_tmp~0_In-9938103 |P2Thread1of1ForFork0_#t~ite48_Out-9938103|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-9938103, ~z$flush_delayed~0=~z$flush_delayed~0_In-9938103, ~z~0=~z~0_In-9938103} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-9938103|, ~z$mem_tmp~0=~z$mem_tmp~0_In-9938103, ~z$flush_delayed~0=~z$flush_delayed~0_In-9938103, ~z~0=~z~0_In-9938103} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 14:35:21,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 14:35:21,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In600474959 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In600474959 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out600474959|) (not .cse1)) (and (= ~z$w_buff0_used~0_In600474959 |P2Thread1of1ForFork0_#t~ite51_Out600474959|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out600474959|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 14:35:21,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1693622312 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1693622312 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1693622312 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1693622312 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| ~z$w_buff1_used~0_In-1693622312)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1693622312|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 14:35:21,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1318378344 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-1318378344 ~z$r_buff0_thd3~0_Out-1318378344)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1318378344 256) 0))) (or (and (= ~z$r_buff0_thd3~0_Out-1318378344 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1318378344} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1318378344, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1318378344|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 14:35:21,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1605106035 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1605106035 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1605106035 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1605106035 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1605106035|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1605106035 |P2Thread1of1ForFork0_#t~ite54_Out1605106035|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1605106035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1605106035|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1605106035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:35:21,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 14:35:21,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In900272780 256)))) (or (and (= ~z~0_In900272780 |P1Thread1of1ForFork2_#t~ite25_Out900272780|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In900272780 |P1Thread1of1ForFork2_#t~ite25_Out900272780|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In900272780, ~z$flush_delayed~0=~z$flush_delayed~0_In900272780, ~z~0=~z~0_In900272780} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In900272780, ~z$flush_delayed~0=~z$flush_delayed~0_In900272780, ~z~0=~z~0_In900272780, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out900272780|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:35:21,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 v_~z$flush_delayed~0_267) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:35:21,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:35:21,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out1195589515| |ULTIMATE.start_main_#t~ite59_Out1195589515|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1195589515 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1195589515 256)))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1195589515| ~z~0_In1195589515) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out1195589515| ~z$w_buff1~0_In1195589515)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1195589515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1195589515, ~z$w_buff1~0=~z$w_buff1~0_In1195589515, ~z~0=~z~0_In1195589515} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1195589515, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1195589515|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1195589515, ~z$w_buff1~0=~z$w_buff1~0_In1195589515, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1195589515|, ~z~0=~z~0_In1195589515} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:35:21,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1168595039 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1168595039 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1168595039|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1168595039 |ULTIMATE.start_main_#t~ite60_Out-1168595039|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1168595039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168595039} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1168595039|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1168595039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168595039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 14:35:21,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1203391386 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1203391386 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1203391386 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1203391386 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1203391386|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1203391386 |ULTIMATE.start_main_#t~ite61_Out-1203391386|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1203391386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1203391386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1203391386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1203391386} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1203391386, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1203391386|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1203391386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1203391386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1203391386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:35:21,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1208885743 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1208885743 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1208885743 |ULTIMATE.start_main_#t~ite62_Out-1208885743|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1208885743|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1208885743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1208885743} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1208885743|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1208885743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1208885743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:35:21,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2003363654 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2003363654 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2003363654 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2003363654 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out2003363654| ~z$r_buff1_thd0~0_In2003363654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out2003363654|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2003363654|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:35:21,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:35:22,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:35:22 BasicIcfg [2019-12-07 14:35:22,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:35:22,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:35:22,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:35:22,066 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:35:22,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:35:05" (3/4) ... [2019-12-07 14:35:22,068 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:35:22,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t406~0.base_114|) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t406~0.base_114| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114| 1) |v_#valid_146|) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= 0 |v_ULTIMATE.start_main_~#t406~0.offset_64|) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114|) |v_ULTIMATE.start_main_~#t406~0.offset_64| 0))) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_63|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_38|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_38|, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t406~0.offset=|v_ULTIMATE.start_main_~#t406~0.offset_64|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_87|, ULTIMATE.start_main_~#t406~0.base=|v_ULTIMATE.start_main_~#t406~0.base_114|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t408~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t408~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t407~0.offset, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t406~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t407~0.base, ULTIMATE.start_main_~#t406~0.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:35:22,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t407~0.base_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t407~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11|) |v_ULTIMATE.start_main_~#t407~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t407~0.base_11| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t407~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_10|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t407~0.offset, ULTIMATE.start_main_~#t407~0.base] because there is no mapped edge [2019-12-07 14:35:22,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11|) |v_ULTIMATE.start_main_~#t408~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t408~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t408~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t408~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t408~0.base_11| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t408~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t408~0.offset, #length] because there is no mapped edge [2019-12-07 14:35:22,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_200 256) 0)) (not (= (mod v_~z$w_buff0_used~0_347 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= v_~z$w_buff0~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 14:35:22,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-402712398 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-402712398 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff0~0_In-402712398 |P2Thread1of1ForFork0_#t~ite28_Out-402712398|)) (and (= ~z$w_buff1~0_In-402712398 |P2Thread1of1ForFork0_#t~ite28_Out-402712398|) (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-402712398, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-402712398, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-402712398, ~z$w_buff1~0=~z$w_buff1~0_In-402712398} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-402712398|, ~z$w_buff0~0=~z$w_buff0~0_In-402712398, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-402712398, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-402712398, ~z$w_buff1~0=~z$w_buff1~0_In-402712398} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:35:22,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:35:22,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 14:35:22,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-9938103 256)))) (or (and (= ~z~0_In-9938103 |P2Thread1of1ForFork0_#t~ite48_Out-9938103|) .cse0) (and (= ~z$mem_tmp~0_In-9938103 |P2Thread1of1ForFork0_#t~ite48_Out-9938103|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-9938103, ~z$flush_delayed~0=~z$flush_delayed~0_In-9938103, ~z~0=~z~0_In-9938103} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-9938103|, ~z$mem_tmp~0=~z$mem_tmp~0_In-9938103, ~z$flush_delayed~0=~z$flush_delayed~0_In-9938103, ~z~0=~z~0_In-9938103} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 14:35:22,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 14:35:22,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In600474959 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In600474959 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out600474959|) (not .cse1)) (and (= ~z$w_buff0_used~0_In600474959 |P2Thread1of1ForFork0_#t~ite51_Out600474959|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out600474959|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 14:35:22,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1693622312 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1693622312 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1693622312 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1693622312 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| ~z$w_buff1_used~0_In-1693622312)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1693622312|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 14:35:22,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1318378344 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-1318378344 ~z$r_buff0_thd3~0_Out-1318378344)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1318378344 256) 0))) (or (and (= ~z$r_buff0_thd3~0_Out-1318378344 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1318378344} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1318378344, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1318378344|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 14:35:22,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1605106035 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1605106035 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1605106035 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1605106035 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1605106035|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1605106035 |P2Thread1of1ForFork0_#t~ite54_Out1605106035|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1605106035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1605106035|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1605106035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:35:22,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 14:35:22,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In900272780 256)))) (or (and (= ~z~0_In900272780 |P1Thread1of1ForFork2_#t~ite25_Out900272780|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In900272780 |P1Thread1of1ForFork2_#t~ite25_Out900272780|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In900272780, ~z$flush_delayed~0=~z$flush_delayed~0_In900272780, ~z~0=~z~0_In900272780} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In900272780, ~z$flush_delayed~0=~z$flush_delayed~0_In900272780, ~z~0=~z~0_In900272780, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out900272780|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:35:22,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 v_~z$flush_delayed~0_267) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:35:22,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:35:22,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out1195589515| |ULTIMATE.start_main_#t~ite59_Out1195589515|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1195589515 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1195589515 256)))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1195589515| ~z~0_In1195589515) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out1195589515| ~z$w_buff1~0_In1195589515)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1195589515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1195589515, ~z$w_buff1~0=~z$w_buff1~0_In1195589515, ~z~0=~z~0_In1195589515} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1195589515, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1195589515|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1195589515, ~z$w_buff1~0=~z$w_buff1~0_In1195589515, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1195589515|, ~z~0=~z~0_In1195589515} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:35:22,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1168595039 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1168595039 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1168595039|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1168595039 |ULTIMATE.start_main_#t~ite60_Out-1168595039|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1168595039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168595039} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1168595039|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1168595039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168595039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 14:35:22,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1203391386 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1203391386 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1203391386 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1203391386 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1203391386|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1203391386 |ULTIMATE.start_main_#t~ite61_Out-1203391386|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1203391386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1203391386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1203391386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1203391386} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1203391386, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1203391386|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1203391386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1203391386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1203391386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:35:22,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1208885743 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1208885743 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1208885743 |ULTIMATE.start_main_#t~ite62_Out-1208885743|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1208885743|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1208885743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1208885743} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1208885743|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1208885743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1208885743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:35:22,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2003363654 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2003363654 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2003363654 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2003363654 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out2003363654| ~z$r_buff1_thd0~0_In2003363654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out2003363654|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2003363654|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:35:22,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:35:22,164 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_becc3302-1868-4af3-b6ff-a810084f5054/bin/uautomizer/witness.graphml [2019-12-07 14:35:22,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:35:22,165 INFO L168 Benchmark]: Toolchain (without parser) took 17573.89 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 855.6 MB). Free memory was 939.8 MB in the beginning and 845.2 MB in the end (delta: 94.6 MB). Peak memory consumption was 950.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:35:22,165 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:35:22,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:35:22,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.86 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 14:35:22,166 INFO L168 Benchmark]: Boogie Preprocessor took 27.74 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 14:35:22,166 INFO L168 Benchmark]: RCFGBuilder took 434.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.6 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:35:22,166 INFO L168 Benchmark]: TraceAbstraction took 16569.26 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 756.0 MB). Free memory was 997.6 MB in the beginning and 886.1 MB in the end (delta: 111.5 MB). Peak memory consumption was 867.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:35:22,167 INFO L168 Benchmark]: Witness Printer took 98.20 ms. Allocated memory is still 1.9 GB. Free memory was 886.1 MB in the beginning and 845.2 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:35:22,168 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 434.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.6 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16569.26 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 756.0 MB). Free memory was 997.6 MB in the beginning and 886.1 MB in the end (delta: 111.5 MB). Peak memory consumption was 867.5 MB. Max. memory is 11.5 GB. * Witness Printer took 98.20 ms. Allocated memory is still 1.9 GB. Free memory was 886.1 MB in the beginning and 845.2 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9454 VarBasedMoverChecksPositive, 317 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124397 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t406, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t407, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t408, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 y = 1 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3463 SDtfs, 5827 SDslu, 10458 SDs, 0 SdLazy, 4269 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44886occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 11128 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 764 NumberOfCodeBlocks, 764 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 239060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...