./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_pso.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_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/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 0022434ac636950e369a1f65bbc780d7b71e39a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 15:16:21,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:16:21,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:16:21,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:16:21,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:16:21,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:16:21,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:16:21,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:16:21,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:16:21,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:16:21,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:16:21,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:16:21,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:16:21,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:16:21,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:16:21,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:16:21,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:16:21,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:16:21,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:16:21,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:16:21,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:16:21,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:16:21,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:16:21,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:16:21,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:16:21,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:16:21,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:16:21,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:16:21,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:16:21,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:16:21,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:16:21,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:16:21,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:16:21,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:16:21,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:16:21,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:16:21,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:16:21,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:16:21,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:16:21,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:16:21,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:16:21,708 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:16:21,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:16:21,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:16:21,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:16:21,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:16:21,718 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:16:21,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:16:21,719 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:16:21,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:16:21,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:16:21,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:16:21,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:16:21,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:16:21,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:16:21,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:16:21,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:16:21,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:16:21,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:16:21,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:16:21,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:16:21,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:16:21,721 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_c0e54963-850d-460b-9af8-bb3e7e580817/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 -> 0022434ac636950e369a1f65bbc780d7b71e39a3 [2019-12-07 15:16:21,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:16:21,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:16:21,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:16:21,835 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:16:21,835 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:16:21,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix010_pso.opt.i [2019-12-07 15:16:21,883 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/data/49fb0ddb8/f55a40243ead4aee8c8bf23c8f6e54c9/FLAG80b743253 [2019-12-07 15:16:22,390 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:16:22,390 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/sv-benchmarks/c/pthread-wmm/mix010_pso.opt.i [2019-12-07 15:16:22,401 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/data/49fb0ddb8/f55a40243ead4aee8c8bf23c8f6e54c9/FLAG80b743253 [2019-12-07 15:16:22,908 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/data/49fb0ddb8/f55a40243ead4aee8c8bf23c8f6e54c9 [2019-12-07 15:16:22,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:16:22,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:16:22,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:16:22,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:16:22,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:16:22,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:16:22" (1/1) ... [2019-12-07 15:16:22,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45498917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:22, skipping insertion in model container [2019-12-07 15:16:22,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:16:22" (1/1) ... [2019-12-07 15:16:22,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:16:22,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:16:23,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:16:23,213 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:16:23,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:16:23,302 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:16:23,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23 WrapperNode [2019-12-07 15:16:23,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:16:23,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:16:23,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:16:23,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:16:23,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:16:23,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:16:23,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:16:23,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:16:23,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... [2019-12-07 15:16:23,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:16:23,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:16:23,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:16:23,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:16:23,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/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 15:16:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:16:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:16:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:16:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:16:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:16:23,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:16:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:16:23,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:16:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 15:16:23,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 15:16:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:16:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:16:23,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:16:23,413 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 15:16:23,805 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:16:23,805 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:16:23,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:16:23 BoogieIcfgContainer [2019-12-07 15:16:23,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:16:23,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:16:23,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:16:23,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:16:23,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:16:22" (1/3) ... [2019-12-07 15:16:23,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6db032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:16:23, skipping insertion in model container [2019-12-07 15:16:23,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:16:23" (2/3) ... [2019-12-07 15:16:23,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6db032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:16:23, skipping insertion in model container [2019-12-07 15:16:23,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:16:23" (3/3) ... [2019-12-07 15:16:23,812 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.opt.i [2019-12-07 15:16:23,819 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:16:23,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:16:23,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:16:23,824 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:16:23,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,870 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,870 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,871 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,871 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,871 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:16:23,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 15:16:23,912 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:16:23,912 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:16:23,912 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:16:23,913 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:16:23,913 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:16:23,913 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:16:23,913 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:16:23,913 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:16:23,926 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 15:16:23,927 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 15:16:23,997 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 15:16:23,997 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:16:24,010 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 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 15:16:24,031 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 15:16:24,075 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 15:16:24,075 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:16:24,084 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 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 15:16:24,108 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 15:16:24,109 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:16:27,440 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 15:16:27,800 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 15:16:27,905 INFO L206 etLargeBlockEncoding]: Checked pairs total: 138188 [2019-12-07 15:16:27,905 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 15:16:27,907 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 129 transitions [2019-12-07 15:16:30,595 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-07 15:16:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-07 15:16:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:16:30,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:30,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:30,601 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 15:16:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1166715454, now seen corresponding path program 1 times [2019-12-07 15:16:30,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:30,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056752145] [2019-12-07 15:16:30,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:30,762 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 15:16:30,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056752145] [2019-12-07 15:16:30,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:30,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:16:30,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832247718] [2019-12-07 15:16:30,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:30,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:30,777 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-07 15:16:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:31,176 INFO L93 Difference]: Finished difference Result 43270 states and 177632 transitions. [2019-12-07 15:16:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:31,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 15:16:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:31,420 INFO L225 Difference]: With dead ends: 43270 [2019-12-07 15:16:31,420 INFO L226 Difference]: Without dead ends: 40300 [2019-12-07 15:16:31,421 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 15:16:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40300 states. [2019-12-07 15:16:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40300 to 40300. [2019-12-07 15:16:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2019-12-07 15:16:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 165323 transitions. [2019-12-07 15:16:32,874 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 165323 transitions. Word has length 7 [2019-12-07 15:16:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:32,875 INFO L462 AbstractCegarLoop]: Abstraction has 40300 states and 165323 transitions. [2019-12-07 15:16:32,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 165323 transitions. [2019-12-07 15:16:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:16:32,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:32,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:32,879 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 15:16:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash 446345132, now seen corresponding path program 1 times [2019-12-07 15:16:32,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:32,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60704054] [2019-12-07 15:16:32,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:32,948 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 15:16:32,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60704054] [2019-12-07 15:16:32,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:32,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:32,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555532543] [2019-12-07 15:16:32,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:32,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:32,950 INFO L87 Difference]: Start difference. First operand 40300 states and 165323 transitions. Second operand 4 states. [2019-12-07 15:16:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:33,536 INFO L93 Difference]: Finished difference Result 64232 states and 253053 transitions. [2019-12-07 15:16:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:33,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 15:16:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:33,716 INFO L225 Difference]: With dead ends: 64232 [2019-12-07 15:16:33,716 INFO L226 Difference]: Without dead ends: 64202 [2019-12-07 15:16:33,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:16:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64202 states. [2019-12-07 15:16:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64202 to 62556. [2019-12-07 15:16:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62556 states. [2019-12-07 15:16:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 247863 transitions. [2019-12-07 15:16:35,691 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 247863 transitions. Word has length 13 [2019-12-07 15:16:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:35,691 INFO L462 AbstractCegarLoop]: Abstraction has 62556 states and 247863 transitions. [2019-12-07 15:16:35,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 247863 transitions. [2019-12-07 15:16:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:16:35,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:35,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:35,698 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 15:16:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1030418596, now seen corresponding path program 1 times [2019-12-07 15:16:35,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:35,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447493213] [2019-12-07 15:16:35,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:35,765 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 15:16:35,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447493213] [2019-12-07 15:16:35,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:35,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:35,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070288092] [2019-12-07 15:16:35,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:35,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:35,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:35,766 INFO L87 Difference]: Start difference. First operand 62556 states and 247863 transitions. Second operand 4 states. [2019-12-07 15:16:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:36,242 INFO L93 Difference]: Finished difference Result 80364 states and 313729 transitions. [2019-12-07 15:16:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:36,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 15:16:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:36,426 INFO L225 Difference]: With dead ends: 80364 [2019-12-07 15:16:36,426 INFO L226 Difference]: Without dead ends: 80336 [2019-12-07 15:16:36,426 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 15:16:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80336 states. [2019-12-07 15:16:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80336 to 71524. [2019-12-07 15:16:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71524 states. [2019-12-07 15:16:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71524 states to 71524 states and 281953 transitions. [2019-12-07 15:16:38,380 INFO L78 Accepts]: Start accepts. Automaton has 71524 states and 281953 transitions. Word has length 16 [2019-12-07 15:16:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:38,380 INFO L462 AbstractCegarLoop]: Abstraction has 71524 states and 281953 transitions. [2019-12-07 15:16:38,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 71524 states and 281953 transitions. [2019-12-07 15:16:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:16:38,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:38,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:38,388 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 15:16:38,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash -239561606, now seen corresponding path program 1 times [2019-12-07 15:16:38,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:38,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303090524] [2019-12-07 15:16:38,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:38,434 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 15:16:38,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303090524] [2019-12-07 15:16:38,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:38,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:38,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546553755] [2019-12-07 15:16:38,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:38,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:38,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:38,435 INFO L87 Difference]: Start difference. First operand 71524 states and 281953 transitions. Second operand 3 states. [2019-12-07 15:16:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:38,847 INFO L93 Difference]: Finished difference Result 71524 states and 278893 transitions. [2019-12-07 15:16:38,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:38,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 15:16:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:38,995 INFO L225 Difference]: With dead ends: 71524 [2019-12-07 15:16:38,995 INFO L226 Difference]: Without dead ends: 71524 [2019-12-07 15:16:38,995 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 15:16:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71524 states. [2019-12-07 15:16:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71524 to 71316. [2019-12-07 15:16:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71316 states. [2019-12-07 15:16:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71316 states to 71316 states and 278233 transitions. [2019-12-07 15:16:42,284 INFO L78 Accepts]: Start accepts. Automaton has 71316 states and 278233 transitions. Word has length 18 [2019-12-07 15:16:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:42,284 INFO L462 AbstractCegarLoop]: Abstraction has 71316 states and 278233 transitions. [2019-12-07 15:16:42,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 71316 states and 278233 transitions. [2019-12-07 15:16:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:16:42,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:42,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:42,289 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 15:16:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 419417230, now seen corresponding path program 1 times [2019-12-07 15:16:42,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:42,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323846576] [2019-12-07 15:16:42,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:42,341 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 15:16:42,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323846576] [2019-12-07 15:16:42,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:42,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:16:42,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207753399] [2019-12-07 15:16:42,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:42,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:42,342 INFO L87 Difference]: Start difference. First operand 71316 states and 278233 transitions. Second operand 3 states. [2019-12-07 15:16:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:42,611 INFO L93 Difference]: Finished difference Result 71336 states and 278133 transitions. [2019-12-07 15:16:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:42,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 15:16:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:42,760 INFO L225 Difference]: With dead ends: 71336 [2019-12-07 15:16:42,760 INFO L226 Difference]: Without dead ends: 71336 [2019-12-07 15:16:42,760 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 15:16:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71336 states. [2019-12-07 15:16:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71336 to 71251. [2019-12-07 15:16:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71251 states. [2019-12-07 15:16:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71251 states to 71251 states and 277954 transitions. [2019-12-07 15:16:44,583 INFO L78 Accepts]: Start accepts. Automaton has 71251 states and 277954 transitions. Word has length 18 [2019-12-07 15:16:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:44,584 INFO L462 AbstractCegarLoop]: Abstraction has 71251 states and 277954 transitions. [2019-12-07 15:16:44,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 71251 states and 277954 transitions. [2019-12-07 15:16:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:16:44,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:44,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:44,589 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 15:16:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -87585687, now seen corresponding path program 1 times [2019-12-07 15:16:44,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:44,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175671623] [2019-12-07 15:16:44,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:44,632 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 15:16:44,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175671623] [2019-12-07 15:16:44,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:44,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:16:44,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173380448] [2019-12-07 15:16:44,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:44,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:44,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:44,633 INFO L87 Difference]: Start difference. First operand 71251 states and 277954 transitions. Second operand 4 states. [2019-12-07 15:16:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:44,782 INFO L93 Difference]: Finished difference Result 43205 states and 147553 transitions. [2019-12-07 15:16:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:16:44,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 15:16:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:44,846 INFO L225 Difference]: With dead ends: 43205 [2019-12-07 15:16:44,846 INFO L226 Difference]: Without dead ends: 39027 [2019-12-07 15:16:44,846 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 15:16:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39027 states. [2019-12-07 15:16:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39027 to 39027. [2019-12-07 15:16:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39027 states. [2019-12-07 15:16:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39027 states to 39027 states and 132911 transitions. [2019-12-07 15:16:45,671 INFO L78 Accepts]: Start accepts. Automaton has 39027 states and 132911 transitions. Word has length 19 [2019-12-07 15:16:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:45,672 INFO L462 AbstractCegarLoop]: Abstraction has 39027 states and 132911 transitions. [2019-12-07 15:16:45,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 39027 states and 132911 transitions. [2019-12-07 15:16:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:16:45,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:45,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:45,675 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 15:16:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -778741345, now seen corresponding path program 1 times [2019-12-07 15:16:45,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:45,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744561328] [2019-12-07 15:16:45,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:45,731 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 15:16:45,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744561328] [2019-12-07 15:16:45,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:45,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:45,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503560294] [2019-12-07 15:16:45,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:45,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:45,733 INFO L87 Difference]: Start difference. First operand 39027 states and 132911 transitions. Second operand 4 states. [2019-12-07 15:16:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:45,880 INFO L93 Difference]: Finished difference Result 38977 states and 132685 transitions. [2019-12-07 15:16:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:16:45,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 15:16:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:45,946 INFO L225 Difference]: With dead ends: 38977 [2019-12-07 15:16:45,946 INFO L226 Difference]: Without dead ends: 38977 [2019-12-07 15:16:45,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38977 states. [2019-12-07 15:16:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38977 to 38935. [2019-12-07 15:16:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38935 states. [2019-12-07 15:16:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38935 states to 38935 states and 132617 transitions. [2019-12-07 15:16:46,944 INFO L78 Accepts]: Start accepts. Automaton has 38935 states and 132617 transitions. Word has length 19 [2019-12-07 15:16:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:46,944 INFO L462 AbstractCegarLoop]: Abstraction has 38935 states and 132617 transitions. [2019-12-07 15:16:46,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38935 states and 132617 transitions. [2019-12-07 15:16:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:16:46,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:46,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:46,947 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 15:16:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash 45422068, now seen corresponding path program 1 times [2019-12-07 15:16:46,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:46,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135377874] [2019-12-07 15:16:46,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:46,994 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 15:16:46,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135377874] [2019-12-07 15:16:46,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:46,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:16:46,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835307740] [2019-12-07 15:16:46,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:46,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:46,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:46,996 INFO L87 Difference]: Start difference. First operand 38935 states and 132617 transitions. Second operand 4 states. [2019-12-07 15:16:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:47,237 INFO L93 Difference]: Finished difference Result 68260 states and 233367 transitions. [2019-12-07 15:16:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:47,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 15:16:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:47,356 INFO L225 Difference]: With dead ends: 68260 [2019-12-07 15:16:47,356 INFO L226 Difference]: Without dead ends: 67846 [2019-12-07 15:16:47,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:16:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67846 states. [2019-12-07 15:16:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67846 to 67716. [2019-12-07 15:16:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67716 states. [2019-12-07 15:16:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67716 states to 67716 states and 231928 transitions. [2019-12-07 15:16:48,712 INFO L78 Accepts]: Start accepts. Automaton has 67716 states and 231928 transitions. Word has length 20 [2019-12-07 15:16:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:48,712 INFO L462 AbstractCegarLoop]: Abstraction has 67716 states and 231928 transitions. [2019-12-07 15:16:48,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 67716 states and 231928 transitions. [2019-12-07 15:16:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:16:48,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:48,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:48,718 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 15:16:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204152, now seen corresponding path program 2 times [2019-12-07 15:16:48,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:48,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115131475] [2019-12-07 15:16:48,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:16:48,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115131475] [2019-12-07 15:16:48,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:48,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:16:48,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24384501] [2019-12-07 15:16:48,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:48,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:48,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:48,748 INFO L87 Difference]: Start difference. First operand 67716 states and 231928 transitions. Second operand 3 states. [2019-12-07 15:16:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:48,966 INFO L93 Difference]: Finished difference Result 65541 states and 224235 transitions. [2019-12-07 15:16:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:48,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 15:16:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:49,088 INFO L225 Difference]: With dead ends: 65541 [2019-12-07 15:16:49,088 INFO L226 Difference]: Without dead ends: 65541 [2019-12-07 15:16:49,089 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 15:16:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65541 states. [2019-12-07 15:16:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65541 to 42988. [2019-12-07 15:16:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42988 states. [2019-12-07 15:16:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42988 states to 42988 states and 145104 transitions. [2019-12-07 15:16:50,260 INFO L78 Accepts]: Start accepts. Automaton has 42988 states and 145104 transitions. Word has length 20 [2019-12-07 15:16:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:50,261 INFO L462 AbstractCegarLoop]: Abstraction has 42988 states and 145104 transitions. [2019-12-07 15:16:50,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42988 states and 145104 transitions. [2019-12-07 15:16:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:16:50,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:50,267 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] [2019-12-07 15:16:50,267 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 15:16:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash -829401387, now seen corresponding path program 1 times [2019-12-07 15:16:50,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:50,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171875154] [2019-12-07 15:16:50,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:50,312 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 15:16:50,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171875154] [2019-12-07 15:16:50,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:50,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:16:50,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724255643] [2019-12-07 15:16:50,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:16:50,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:16:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:16:50,313 INFO L87 Difference]: Start difference. First operand 42988 states and 145104 transitions. Second operand 5 states. [2019-12-07 15:16:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:50,375 INFO L93 Difference]: Finished difference Result 9204 states and 27361 transitions. [2019-12-07 15:16:50,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:50,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 15:16:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:50,382 INFO L225 Difference]: With dead ends: 9204 [2019-12-07 15:16:50,382 INFO L226 Difference]: Without dead ends: 6473 [2019-12-07 15:16:50,383 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 15:16:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2019-12-07 15:16:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 6393. [2019-12-07 15:16:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6393 states. [2019-12-07 15:16:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 17826 transitions. [2019-12-07 15:16:50,452 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 17826 transitions. Word has length 23 [2019-12-07 15:16:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:50,452 INFO L462 AbstractCegarLoop]: Abstraction has 6393 states and 17826 transitions. [2019-12-07 15:16:50,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:16:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 17826 transitions. [2019-12-07 15:16:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:16:50,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:50,457 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 15:16:50,457 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 15:16:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash -324942448, now seen corresponding path program 1 times [2019-12-07 15:16:50,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:50,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252664520] [2019-12-07 15:16:50,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:50,509 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 15:16:50,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252664520] [2019-12-07 15:16:50,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:50,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:16:50,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316844567] [2019-12-07 15:16:50,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:16:50,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:16:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:16:50,510 INFO L87 Difference]: Start difference. First operand 6393 states and 17826 transitions. Second operand 6 states. [2019-12-07 15:16:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:50,558 INFO L93 Difference]: Finished difference Result 4906 states and 14348 transitions. [2019-12-07 15:16:50,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:16:50,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 15:16:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:50,563 INFO L225 Difference]: With dead ends: 4906 [2019-12-07 15:16:50,563 INFO L226 Difference]: Without dead ends: 4706 [2019-12-07 15:16:50,564 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 15:16:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2019-12-07 15:16:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 4264. [2019-12-07 15:16:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4264 states. [2019-12-07 15:16:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 12848 transitions. [2019-12-07 15:16:50,615 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 12848 transitions. Word has length 31 [2019-12-07 15:16:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:50,615 INFO L462 AbstractCegarLoop]: Abstraction has 4264 states and 12848 transitions. [2019-12-07 15:16:50,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:16:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 12848 transitions. [2019-12-07 15:16:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 15:16:50,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:50,621 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 15:16:50,622 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 15:16:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2056690107, now seen corresponding path program 1 times [2019-12-07 15:16:50,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:50,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918755577] [2019-12-07 15:16:50,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:50,708 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 15:16:50,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918755577] [2019-12-07 15:16:50,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:50,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:16:50,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705579170] [2019-12-07 15:16:50,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:16:50,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:16:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:16:50,709 INFO L87 Difference]: Start difference. First operand 4264 states and 12848 transitions. Second operand 7 states. [2019-12-07 15:16:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:50,953 INFO L93 Difference]: Finished difference Result 9182 states and 27275 transitions. [2019-12-07 15:16:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 15:16:50,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 15:16:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:50,966 INFO L225 Difference]: With dead ends: 9182 [2019-12-07 15:16:50,967 INFO L226 Difference]: Without dead ends: 8200 [2019-12-07 15:16:50,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:16:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2019-12-07 15:16:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 6424. [2019-12-07 15:16:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6424 states. [2019-12-07 15:16:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6424 states to 6424 states and 19854 transitions. [2019-12-07 15:16:51,078 INFO L78 Accepts]: Start accepts. Automaton has 6424 states and 19854 transitions. Word has length 62 [2019-12-07 15:16:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:51,078 INFO L462 AbstractCegarLoop]: Abstraction has 6424 states and 19854 transitions. [2019-12-07 15:16:51,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:16:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6424 states and 19854 transitions. [2019-12-07 15:16:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 15:16:51,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:51,088 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 15:16:51,088 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 15:16:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:51,088 INFO L82 PathProgramCache]: Analyzing trace with hash 576227763, now seen corresponding path program 2 times [2019-12-07 15:16:51,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:51,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465956468] [2019-12-07 15:16:51,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:51,182 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 15:16:51,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465956468] [2019-12-07 15:16:51,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:51,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:16:51,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422169739] [2019-12-07 15:16:51,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:16:51,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:16:51,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:16:51,184 INFO L87 Difference]: Start difference. First operand 6424 states and 19854 transitions. Second operand 7 states. [2019-12-07 15:16:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:51,338 INFO L93 Difference]: Finished difference Result 14167 states and 43435 transitions. [2019-12-07 15:16:51,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:16:51,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 15:16:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:51,352 INFO L225 Difference]: With dead ends: 14167 [2019-12-07 15:16:51,352 INFO L226 Difference]: Without dead ends: 11884 [2019-12-07 15:16:51,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:16:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2019-12-07 15:16:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 9300. [2019-12-07 15:16:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9300 states. [2019-12-07 15:16:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9300 states to 9300 states and 28884 transitions. [2019-12-07 15:16:51,487 INFO L78 Accepts]: Start accepts. Automaton has 9300 states and 28884 transitions. Word has length 62 [2019-12-07 15:16:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:51,487 INFO L462 AbstractCegarLoop]: Abstraction has 9300 states and 28884 transitions. [2019-12-07 15:16:51,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:16:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9300 states and 28884 transitions. [2019-12-07 15:16:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 15:16:51,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:51,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] [2019-12-07 15:16:51,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 15:16:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1506410157, now seen corresponding path program 3 times [2019-12-07 15:16:51,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:51,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518083816] [2019-12-07 15:16:51,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:51,742 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 15:16:51,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518083816] [2019-12-07 15:16:51,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:51,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:16:51,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086576927] [2019-12-07 15:16:51,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:16:51,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:16:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:16:51,743 INFO L87 Difference]: Start difference. First operand 9300 states and 28884 transitions. Second operand 10 states. [2019-12-07 15:16:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:52,531 INFO L93 Difference]: Finished difference Result 24550 states and 73063 transitions. [2019-12-07 15:16:52,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:16:52,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 15:16:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:52,556 INFO L225 Difference]: With dead ends: 24550 [2019-12-07 15:16:52,556 INFO L226 Difference]: Without dead ends: 23548 [2019-12-07 15:16:52,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:16:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2019-12-07 15:16:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 16892. [2019-12-07 15:16:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16892 states. [2019-12-07 15:16:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16892 states to 16892 states and 52032 transitions. [2019-12-07 15:16:52,812 INFO L78 Accepts]: Start accepts. Automaton has 16892 states and 52032 transitions. Word has length 62 [2019-12-07 15:16:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:52,813 INFO L462 AbstractCegarLoop]: Abstraction has 16892 states and 52032 transitions. [2019-12-07 15:16:52,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:16:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16892 states and 52032 transitions. [2019-12-07 15:16:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 15:16:52,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:52,835 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 15:16:52,836 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 15:16:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1807325087, now seen corresponding path program 4 times [2019-12-07 15:16:52,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:52,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852992080] [2019-12-07 15:16:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:53,040 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 15:16:53,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852992080] [2019-12-07 15:16:53,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:53,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:16:53,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893866724] [2019-12-07 15:16:53,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:16:53,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:16:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:16:53,041 INFO L87 Difference]: Start difference. First operand 16892 states and 52032 transitions. Second operand 9 states. [2019-12-07 15:16:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:54,014 INFO L93 Difference]: Finished difference Result 25144 states and 73745 transitions. [2019-12-07 15:16:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:16:54,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 15:16:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:54,040 INFO L225 Difference]: With dead ends: 25144 [2019-12-07 15:16:54,041 INFO L226 Difference]: Without dead ends: 24441 [2019-12-07 15:16:54,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:16:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24441 states. [2019-12-07 15:16:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24441 to 20645. [2019-12-07 15:16:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20645 states. [2019-12-07 15:16:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20645 states to 20645 states and 62210 transitions. [2019-12-07 15:16:54,387 INFO L78 Accepts]: Start accepts. Automaton has 20645 states and 62210 transitions. Word has length 62 [2019-12-07 15:16:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:54,387 INFO L462 AbstractCegarLoop]: Abstraction has 20645 states and 62210 transitions. [2019-12-07 15:16:54,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:16:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20645 states and 62210 transitions. [2019-12-07 15:16:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 15:16:54,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:54,411 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 15:16:54,411 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 15:16:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 409978591, now seen corresponding path program 5 times [2019-12-07 15:16:54,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:54,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281658623] [2019-12-07 15:16:54,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:54,557 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 15:16:54,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281658623] [2019-12-07 15:16:54,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:54,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:16:54,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143326006] [2019-12-07 15:16:54,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:54,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:54,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:54,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:54,558 INFO L87 Difference]: Start difference. First operand 20645 states and 62210 transitions. Second operand 4 states. [2019-12-07 15:16:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:54,649 INFO L93 Difference]: Finished difference Result 21604 states and 64397 transitions. [2019-12-07 15:16:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:54,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 15:16:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:54,668 INFO L225 Difference]: With dead ends: 21604 [2019-12-07 15:16:54,668 INFO L226 Difference]: Without dead ends: 16392 [2019-12-07 15:16:54,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:16:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16392 states. [2019-12-07 15:16:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16392 to 15085. [2019-12-07 15:16:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15085 states. [2019-12-07 15:16:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 44819 transitions. [2019-12-07 15:16:54,861 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 44819 transitions. Word has length 62 [2019-12-07 15:16:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:54,861 INFO L462 AbstractCegarLoop]: Abstraction has 15085 states and 44819 transitions. [2019-12-07 15:16:54,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 44819 transitions. [2019-12-07 15:16:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 15:16:54,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:54,876 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 15:16:54,876 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1276415571, now seen corresponding path program 1 times [2019-12-07 15:16:54,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:54,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774692707] [2019-12-07 15:16:54,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:54,933 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 15:16:54,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774692707] [2019-12-07 15:16:54,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:54,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:16:54,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371734845] [2019-12-07 15:16:54,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:16:54,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:16:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:16:54,935 INFO L87 Difference]: Start difference. First operand 15085 states and 44819 transitions. Second operand 5 states. [2019-12-07 15:16:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:55,011 INFO L93 Difference]: Finished difference Result 20314 states and 58513 transitions. [2019-12-07 15:16:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:55,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 15:16:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:55,017 INFO L225 Difference]: With dead ends: 20314 [2019-12-07 15:16:55,017 INFO L226 Difference]: Without dead ends: 5632 [2019-12-07 15:16:55,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 15:16:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2019-12-07 15:16:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 5622. [2019-12-07 15:16:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5622 states. [2019-12-07 15:16:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5622 states to 5622 states and 14606 transitions. [2019-12-07 15:16:55,070 INFO L78 Accepts]: Start accepts. Automaton has 5622 states and 14606 transitions. Word has length 63 [2019-12-07 15:16:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:55,071 INFO L462 AbstractCegarLoop]: Abstraction has 5622 states and 14606 transitions. [2019-12-07 15:16:55,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:16:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5622 states and 14606 transitions. [2019-12-07 15:16:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 15:16:55,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:55,075 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 15:16:55,075 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1937884581, now seen corresponding path program 2 times [2019-12-07 15:16:55,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:55,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785474986] [2019-12-07 15:16:55,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:16:55,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785474986] [2019-12-07 15:16:55,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:55,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:16:55,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23824579] [2019-12-07 15:16:55,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:16:55,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:16:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:16:55,132 INFO L87 Difference]: Start difference. First operand 5622 states and 14606 transitions. Second operand 5 states. [2019-12-07 15:16:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:55,163 INFO L93 Difference]: Finished difference Result 6035 states and 15540 transitions. [2019-12-07 15:16:55,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:55,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 15:16:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:55,164 INFO L225 Difference]: With dead ends: 6035 [2019-12-07 15:16:55,164 INFO L226 Difference]: Without dead ends: 511 [2019-12-07 15:16:55,165 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 15:16:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-07 15:16:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 499. [2019-12-07 15:16:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-12-07 15:16:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1055 transitions. [2019-12-07 15:16:55,169 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1055 transitions. Word has length 63 [2019-12-07 15:16:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:55,169 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 1055 transitions. [2019-12-07 15:16:55,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:16:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1055 transitions. [2019-12-07 15:16:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 15:16:55,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:55,170 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 15:16:55,170 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash 742159584, now seen corresponding path program 1 times [2019-12-07 15:16:55,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:55,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217964514] [2019-12-07 15:16:55,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:16:55,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217964514] [2019-12-07 15:16:55,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:55,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:16:55,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066671872] [2019-12-07 15:16:55,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:16:55,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:16:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:16:55,242 INFO L87 Difference]: Start difference. First operand 499 states and 1055 transitions. Second operand 8 states. [2019-12-07 15:16:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:55,428 INFO L93 Difference]: Finished difference Result 920 states and 1945 transitions. [2019-12-07 15:16:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:16:55,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 15:16:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:55,429 INFO L225 Difference]: With dead ends: 920 [2019-12-07 15:16:55,429 INFO L226 Difference]: Without dead ends: 669 [2019-12-07 15:16:55,429 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 15:16:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-07 15:16:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 523. [2019-12-07 15:16:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 15:16:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1100 transitions. [2019-12-07 15:16:55,434 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1100 transitions. Word has length 63 [2019-12-07 15:16:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:55,434 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 1100 transitions. [2019-12-07 15:16:55,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:16:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1100 transitions. [2019-12-07 15:16:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 15:16:55,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:55,434 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 15:16:55,434 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:55,435 INFO L82 PathProgramCache]: Analyzing trace with hash -250797522, now seen corresponding path program 2 times [2019-12-07 15:16:55,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:55,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835450957] [2019-12-07 15:16:55,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:16:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:16:55,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:16:55,510 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:16:55,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t266~0.base_119|) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119|)) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t266~0.base_119| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= |v_ULTIMATE.start_main_~#t266~0.offset_66| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119| 1) |v_#valid_150|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119|) |v_ULTIMATE.start_main_~#t266~0.offset_66| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_39|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_~#t266~0.offset=|v_ULTIMATE.start_main_~#t266~0.offset_66|, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_~#t266~0.base=|v_ULTIMATE.start_main_~#t266~0.base_119|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_39|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t268~0.offset, ULTIMATE.start_main_~#t267~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t266~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t266~0.base, 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, ~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_~#t267~0.offset, ULTIMATE.start_main_~#t268~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~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_#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 15:16:55,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t267~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t267~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11|) |v_ULTIMATE.start_main_~#t267~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t267~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t267~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t267~0.base] because there is no mapped edge [2019-12-07 15:16:55,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) |v_ULTIMATE.start_main_~#t268~0.offset_8| 2)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t268~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) (= |v_ULTIMATE.start_main_~#t268~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t268~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t268~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t268~0.offset] because there is no mapped edge [2019-12-07 15:16:55,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} 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 15:16:55,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1594740969 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1594740969 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1594740969| ~z$w_buff0~0_In-1594740969) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-1594740969| ~z$w_buff1~0_In-1594740969)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1594740969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1594740969, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1594740969, ~z$w_buff1~0=~z$w_buff1~0_In-1594740969} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1594740969|, ~z$w_buff0~0=~z$w_buff0~0_In-1594740969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1594740969, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1594740969, ~z$w_buff1~0=~z$w_buff1~0_In-1594740969} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:16:55,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |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_29, 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 15:16:55,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} 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_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} 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 15:16:55,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In265440502 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In265440502 |P2Thread1of1ForFork0_#t~ite48_Out265440502|)) (and (= ~z~0_In265440502 |P2Thread1of1ForFork0_#t~ite48_Out265440502|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In265440502, ~z$flush_delayed~0=~z$flush_delayed~0_In265440502, ~z~0=~z~0_In265440502} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out265440502|, ~z$mem_tmp~0=~z$mem_tmp~0_In265440502, ~z$flush_delayed~0=~z$flush_delayed~0_In265440502, ~z~0=~z~0_In265440502} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 15:16:55,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 15:16:55,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In614392472 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In614392472 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out614392472|) (not .cse1)) (and (= ~z$w_buff0_used~0_In614392472 |P2Thread1of1ForFork0_#t~ite51_Out614392472|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In614392472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614392472} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In614392472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614392472, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out614392472|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 15:16:55,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In371688700 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In371688700 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In371688700 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In371688700 256) 0))) (or (and (= ~z$w_buff1_used~0_In371688700 |P2Thread1of1ForFork0_#t~ite52_Out371688700|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out371688700|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In371688700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In371688700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In371688700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In371688700} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In371688700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In371688700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In371688700, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out371688700|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In371688700} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 15:16:55,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_In-490735856 ~z$r_buff0_thd3~0_Out-490735856)) (.cse2 (= (mod ~z$w_buff0_used~0_In-490735856 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-490735856 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out-490735856)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-490735856, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-490735856} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-490735856, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-490735856, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-490735856|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 15:16:55,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-989598592 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-989598592 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-989598592 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-989598592 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-989598592|)) (and (= ~z$r_buff1_thd3~0_In-989598592 |P2Thread1of1ForFork0_#t~ite54_Out-989598592|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-989598592, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-989598592, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-989598592, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-989598592} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-989598592, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-989598592|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-989598592, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-989598592, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-989598592} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 15:16:55,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, 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 15:16:55,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-318305134 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-318305134| ~z$mem_tmp~0_In-318305134) (not .cse0)) (and .cse0 (= ~z~0_In-318305134 |P1Thread1of1ForFork2_#t~ite25_Out-318305134|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-318305134, ~z$flush_delayed~0=~z$flush_delayed~0_In-318305134, ~z~0=~z~0_In-318305134} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-318305134, ~z$flush_delayed~0=~z$flush_delayed~0_In-318305134, ~z~0=~z~0_In-318305134, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-318305134|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 15:16:55,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} 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 15:16:55,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:16:55,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-512586833 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-512586833 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-512586833| |ULTIMATE.start_main_#t~ite58_Out-512586833|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-512586833 |ULTIMATE.start_main_#t~ite58_Out-512586833|)) (and (= ~z$w_buff1~0_In-512586833 |ULTIMATE.start_main_#t~ite58_Out-512586833|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512586833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512586833, ~z$w_buff1~0=~z$w_buff1~0_In-512586833, ~z~0=~z~0_In-512586833} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512586833, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-512586833|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512586833, ~z$w_buff1~0=~z$w_buff1~0_In-512586833, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-512586833|, ~z~0=~z~0_In-512586833} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:16:55,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In597147827 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In597147827 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out597147827| 0)) (and (= ~z$w_buff0_used~0_In597147827 |ULTIMATE.start_main_#t~ite60_Out597147827|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In597147827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597147827} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out597147827|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In597147827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597147827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 15:16:55,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-100475598 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-100475598 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-100475598 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-100475598 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-100475598| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-100475598| ~z$w_buff1_used~0_In-100475598) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-100475598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-100475598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-100475598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-100475598} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-100475598, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-100475598|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-100475598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-100475598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-100475598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:16:55,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In559868443 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In559868443 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In559868443 |ULTIMATE.start_main_#t~ite62_Out559868443|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out559868443|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In559868443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In559868443} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out559868443|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In559868443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In559868443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:16:55,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1327599560 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1327599560 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1327599560 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1327599560 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1327599560| ~z$r_buff1_thd0~0_In-1327599560) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1327599560|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1327599560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327599560, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1327599560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327599560} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1327599560|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1327599560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327599560, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1327599560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327599560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 15:16:55,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, 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 15:16:55,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:16:55 BasicIcfg [2019-12-07 15:16:55,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:16:55,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:16:55,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:16:55,595 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:16:55,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:16:23" (3/4) ... [2019-12-07 15:16:55,597 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:16:55,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t266~0.base_119|) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119|)) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t266~0.base_119| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= |v_ULTIMATE.start_main_~#t266~0.offset_66| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119| 1) |v_#valid_150|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119|) |v_ULTIMATE.start_main_~#t266~0.offset_66| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_39|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_~#t266~0.offset=|v_ULTIMATE.start_main_~#t266~0.offset_66|, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_~#t266~0.base=|v_ULTIMATE.start_main_~#t266~0.base_119|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_39|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t268~0.offset, ULTIMATE.start_main_~#t267~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t266~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t266~0.base, 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, ~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_~#t267~0.offset, ULTIMATE.start_main_~#t268~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~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_#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 15:16:55,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t267~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t267~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11|) |v_ULTIMATE.start_main_~#t267~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t267~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t267~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t267~0.base] because there is no mapped edge [2019-12-07 15:16:55,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) |v_ULTIMATE.start_main_~#t268~0.offset_8| 2)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t268~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) (= |v_ULTIMATE.start_main_~#t268~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t268~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t268~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t268~0.offset] because there is no mapped edge [2019-12-07 15:16:55,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} 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 15:16:55,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1594740969 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1594740969 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1594740969| ~z$w_buff0~0_In-1594740969) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-1594740969| ~z$w_buff1~0_In-1594740969)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1594740969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1594740969, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1594740969, ~z$w_buff1~0=~z$w_buff1~0_In-1594740969} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1594740969|, ~z$w_buff0~0=~z$w_buff0~0_In-1594740969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1594740969, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1594740969, ~z$w_buff1~0=~z$w_buff1~0_In-1594740969} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:16:55,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |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_29, 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 15:16:55,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} 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_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} 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 15:16:55,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In265440502 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In265440502 |P2Thread1of1ForFork0_#t~ite48_Out265440502|)) (and (= ~z~0_In265440502 |P2Thread1of1ForFork0_#t~ite48_Out265440502|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In265440502, ~z$flush_delayed~0=~z$flush_delayed~0_In265440502, ~z~0=~z~0_In265440502} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out265440502|, ~z$mem_tmp~0=~z$mem_tmp~0_In265440502, ~z$flush_delayed~0=~z$flush_delayed~0_In265440502, ~z~0=~z~0_In265440502} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 15:16:55,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 15:16:55,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In614392472 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In614392472 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out614392472|) (not .cse1)) (and (= ~z$w_buff0_used~0_In614392472 |P2Thread1of1ForFork0_#t~ite51_Out614392472|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In614392472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614392472} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In614392472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614392472, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out614392472|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 15:16:55,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In371688700 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In371688700 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In371688700 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In371688700 256) 0))) (or (and (= ~z$w_buff1_used~0_In371688700 |P2Thread1of1ForFork0_#t~ite52_Out371688700|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out371688700|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In371688700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In371688700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In371688700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In371688700} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In371688700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In371688700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In371688700, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out371688700|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In371688700} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 15:16:55,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_In-490735856 ~z$r_buff0_thd3~0_Out-490735856)) (.cse2 (= (mod ~z$w_buff0_used~0_In-490735856 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-490735856 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out-490735856)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-490735856, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-490735856} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-490735856, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-490735856, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-490735856|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 15:16:55,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-989598592 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-989598592 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-989598592 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-989598592 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-989598592|)) (and (= ~z$r_buff1_thd3~0_In-989598592 |P2Thread1of1ForFork0_#t~ite54_Out-989598592|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-989598592, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-989598592, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-989598592, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-989598592} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-989598592, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-989598592|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-989598592, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-989598592, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-989598592} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 15:16:55,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, 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 15:16:55,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-318305134 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-318305134| ~z$mem_tmp~0_In-318305134) (not .cse0)) (and .cse0 (= ~z~0_In-318305134 |P1Thread1of1ForFork2_#t~ite25_Out-318305134|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-318305134, ~z$flush_delayed~0=~z$flush_delayed~0_In-318305134, ~z~0=~z~0_In-318305134} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-318305134, ~z$flush_delayed~0=~z$flush_delayed~0_In-318305134, ~z~0=~z~0_In-318305134, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-318305134|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 15:16:55,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} 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 15:16:55,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:16:55,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-512586833 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-512586833 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-512586833| |ULTIMATE.start_main_#t~ite58_Out-512586833|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-512586833 |ULTIMATE.start_main_#t~ite58_Out-512586833|)) (and (= ~z$w_buff1~0_In-512586833 |ULTIMATE.start_main_#t~ite58_Out-512586833|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512586833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512586833, ~z$w_buff1~0=~z$w_buff1~0_In-512586833, ~z~0=~z~0_In-512586833} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512586833, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-512586833|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512586833, ~z$w_buff1~0=~z$w_buff1~0_In-512586833, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-512586833|, ~z~0=~z~0_In-512586833} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:16:55,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In597147827 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In597147827 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out597147827| 0)) (and (= ~z$w_buff0_used~0_In597147827 |ULTIMATE.start_main_#t~ite60_Out597147827|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In597147827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597147827} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out597147827|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In597147827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597147827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 15:16:55,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-100475598 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-100475598 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-100475598 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-100475598 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-100475598| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-100475598| ~z$w_buff1_used~0_In-100475598) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-100475598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-100475598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-100475598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-100475598} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-100475598, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-100475598|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-100475598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-100475598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-100475598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:16:55,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In559868443 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In559868443 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In559868443 |ULTIMATE.start_main_#t~ite62_Out559868443|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out559868443|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In559868443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In559868443} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out559868443|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In559868443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In559868443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:16:55,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1327599560 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1327599560 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1327599560 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1327599560 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1327599560| ~z$r_buff1_thd0~0_In-1327599560) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1327599560|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1327599560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327599560, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1327599560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327599560} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1327599560|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1327599560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1327599560, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1327599560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1327599560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 15:16:55,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, 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 15:16:55,673 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c0e54963-850d-460b-9af8-bb3e7e580817/bin/uautomizer/witness.graphml [2019-12-07 15:16:55,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:16:55,674 INFO L168 Benchmark]: Toolchain (without parser) took 32762.39 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 933.9 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,674 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:16:55,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.67 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,675 INFO L168 Benchmark]: Boogie Preprocessor took 27.07 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,675 INFO L168 Benchmark]: RCFGBuilder took 435.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,675 INFO L168 Benchmark]: TraceAbstraction took 31787.69 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,675 INFO L168 Benchmark]: Witness Printer took 78.03 ms. Allocated memory is still 4.6 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:16:55,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.67 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.07 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31787.69 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 78.03 ms. Allocated memory is still 4.6 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 129 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 28 ChoiceCompositions, 9334 VarBasedMoverChecksPositive, 325 VarBasedMoverChecksNegative, 95 SemBasedMoverChecksPositive, 334 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 138188 CheckedPairsTotal, 129 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(&t266, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t267, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t268, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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_p1_EAX=0, __unbuffered_p1_EBX=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=7, 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] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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 [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) [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 [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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, 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: 31.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4193 SDtfs, 5830 SDslu, 8772 SDs, 0 SdLazy, 3052 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71524occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 50285 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 766 NumberOfCodeBlocks, 766 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 295468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...