./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_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_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/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 1f59c8d239d3b9fa5185b2c7587123a267999e26 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:57:00,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:57:00,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:57:00,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:57:00,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:57:00,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:57:00,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:57:00,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:57:00,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:57:00,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:57:00,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:57:00,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:57:00,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:57:00,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:57:00,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:57:00,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:57:00,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:57:00,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:57:00,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:57:00,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:57:00,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:57:00,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:57:00,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:57:00,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:57:00,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:57:00,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:57:00,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:57:00,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:57:00,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:57:00,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:57:00,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:57:00,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:57:00,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:57:00,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:57:00,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:57:00,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:57:00,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:57:00,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:57:00,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:57:00,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:57:00,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:57:00,033 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:57:00,042 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:57:00,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:57:00,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:57:00,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:57:00,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:57:00,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:57:00,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:57:00,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:57:00,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:57:00,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:57:00,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:57:00,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:57:00,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:57:00,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:57:00,045 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_e4742ce4-f54b-434b-9951-c7b934b552ce/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 -> 1f59c8d239d3b9fa5185b2c7587123a267999e26 [2019-12-07 10:57:00,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:57:00,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:57:00,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:57:00,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:57:00,156 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:57:00,156 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt.i [2019-12-07 10:57:00,192 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/data/2a556ba30/aeb4318bea9042c79c82abc30dfb23ba/FLAG40fddd571 [2019-12-07 10:57:00,728 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:57:00,728 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/sv-benchmarks/c/pthread-wmm/mix012_pso.opt.i [2019-12-07 10:57:00,740 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/data/2a556ba30/aeb4318bea9042c79c82abc30dfb23ba/FLAG40fddd571 [2019-12-07 10:57:01,176 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/data/2a556ba30/aeb4318bea9042c79c82abc30dfb23ba [2019-12-07 10:57:01,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:57:01,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:57:01,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:57:01,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:57:01,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:57:01,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6fc423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01, skipping insertion in model container [2019-12-07 10:57:01,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:57:01,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:57:01,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:57:01,471 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:57:01,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:57:01,565 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:57:01,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01 WrapperNode [2019-12-07 10:57:01,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:57:01,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:57:01,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:57:01,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:57:01,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:57:01,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:57:01,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:57:01,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:57:01,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... [2019-12-07 10:57:01,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:57:01,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:57:01,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:57:01,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:57:01,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/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 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:57:01,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:57:01,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:57:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:57:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:57:01,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:57:01,689 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 10:57:02,078 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:57:02,078 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:57:02,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:57:02 BoogieIcfgContainer [2019-12-07 10:57:02,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:57:02,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:57:02,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:57:02,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:57:02,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:57:01" (1/3) ... [2019-12-07 10:57:02,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b792e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:57:02, skipping insertion in model container [2019-12-07 10:57:02,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:57:01" (2/3) ... [2019-12-07 10:57:02,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b792e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:57:02, skipping insertion in model container [2019-12-07 10:57:02,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:57:02" (3/3) ... [2019-12-07 10:57:02,084 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt.i [2019-12-07 10:57:02,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:57:02,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:57:02,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:57:02,097 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:57:02,162 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:57:02,174 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:57:02,174 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:57:02,174 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:57:02,174 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:57:02,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:57:02,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:57:02,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:57:02,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:57:02,185 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-07 10:57:02,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-07 10:57:02,244 INFO L134 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-07 10:57:02,244 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:57:02,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 917 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:57:02,277 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-07 10:57:02,310 INFO L134 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-07 10:57:02,311 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:57:02,317 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 917 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:57:02,336 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 10:57:02,337 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:57:05,268 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 10:57:05,381 INFO L206 etLargeBlockEncoding]: Checked pairs total: 122314 [2019-12-07 10:57:05,381 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 10:57:05,383 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 126 transitions [2019-12-07 10:57:06,604 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24222 states. [2019-12-07 10:57:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 24222 states. [2019-12-07 10:57:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:57:06,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:06,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:57:06,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash 958600405, now seen corresponding path program 1 times [2019-12-07 10:57:06,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:06,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904368764] [2019-12-07 10:57:06,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:06,773 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 10:57:06,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904368764] [2019-12-07 10:57:06,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:06,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:57:06,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764550432] [2019-12-07 10:57:06,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:57:06,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:57:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:06,789 INFO L87 Difference]: Start difference. First operand 24222 states. Second operand 3 states. [2019-12-07 10:57:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:07,073 INFO L93 Difference]: Finished difference Result 24022 states and 85786 transitions. [2019-12-07 10:57:07,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:57:07,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:57:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:07,225 INFO L225 Difference]: With dead ends: 24022 [2019-12-07 10:57:07,225 INFO L226 Difference]: Without dead ends: 22482 [2019-12-07 10:57:07,226 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 10:57:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22482 states. [2019-12-07 10:57:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22482 to 22482. [2019-12-07 10:57:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22482 states. [2019-12-07 10:57:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 80227 transitions. [2019-12-07 10:57:08,140 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 80227 transitions. Word has length 5 [2019-12-07 10:57:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:08,140 INFO L462 AbstractCegarLoop]: Abstraction has 22482 states and 80227 transitions. [2019-12-07 10:57:08,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:57:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 80227 transitions. [2019-12-07 10:57:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:57:08,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:08,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:08,143 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash -131274802, now seen corresponding path program 1 times [2019-12-07 10:57:08,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:08,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529647652] [2019-12-07 10:57:08,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:08,201 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 10:57:08,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529647652] [2019-12-07 10:57:08,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:08,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:57:08,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710265132] [2019-12-07 10:57:08,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:57:08,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:57:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:57:08,203 INFO L87 Difference]: Start difference. First operand 22482 states and 80227 transitions. Second operand 4 states. [2019-12-07 10:57:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:08,557 INFO L93 Difference]: Finished difference Result 34872 states and 119343 transitions. [2019-12-07 10:57:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:57:08,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:57:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:08,752 INFO L225 Difference]: With dead ends: 34872 [2019-12-07 10:57:08,752 INFO L226 Difference]: Without dead ends: 34857 [2019-12-07 10:57:08,753 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 10:57:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34857 states. [2019-12-07 10:57:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34857 to 33973. [2019-12-07 10:57:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33973 states. [2019-12-07 10:57:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33973 states to 33973 states and 117000 transitions. [2019-12-07 10:57:09,604 INFO L78 Accepts]: Start accepts. Automaton has 33973 states and 117000 transitions. Word has length 11 [2019-12-07 10:57:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:09,604 INFO L462 AbstractCegarLoop]: Abstraction has 33973 states and 117000 transitions. [2019-12-07 10:57:09,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:57:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 33973 states and 117000 transitions. [2019-12-07 10:57:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:57:09,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:09,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:09,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash -570349916, now seen corresponding path program 1 times [2019-12-07 10:57:09,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:09,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377334469] [2019-12-07 10:57:09,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:09,654 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 10:57:09,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377334469] [2019-12-07 10:57:09,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:09,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:57:09,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800939646] [2019-12-07 10:57:09,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:57:09,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:57:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:57:09,655 INFO L87 Difference]: Start difference. First operand 33973 states and 117000 transitions. Second operand 4 states. [2019-12-07 10:57:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:10,076 INFO L93 Difference]: Finished difference Result 43608 states and 147815 transitions. [2019-12-07 10:57:10,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:57:10,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:57:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:10,171 INFO L225 Difference]: With dead ends: 43608 [2019-12-07 10:57:10,171 INFO L226 Difference]: Without dead ends: 43594 [2019-12-07 10:57:10,171 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 10:57:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2019-12-07 10:57:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 39207. [2019-12-07 10:57:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39207 states. [2019-12-07 10:57:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39207 states to 39207 states and 134217 transitions. [2019-12-07 10:57:11,143 INFO L78 Accepts]: Start accepts. Automaton has 39207 states and 134217 transitions. Word has length 14 [2019-12-07 10:57:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:11,144 INFO L462 AbstractCegarLoop]: Abstraction has 39207 states and 134217 transitions. [2019-12-07 10:57:11,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:57:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39207 states and 134217 transitions. [2019-12-07 10:57:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:57:11,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:11,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:11,148 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -500949887, now seen corresponding path program 1 times [2019-12-07 10:57:11,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:11,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504102918] [2019-12-07 10:57:11,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:11,174 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 10:57:11,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504102918] [2019-12-07 10:57:11,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:11,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:57:11,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026480020] [2019-12-07 10:57:11,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:57:11,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:11,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:57:11,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:11,175 INFO L87 Difference]: Start difference. First operand 39207 states and 134217 transitions. Second operand 3 states. [2019-12-07 10:57:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:11,432 INFO L93 Difference]: Finished difference Result 65918 states and 215197 transitions. [2019-12-07 10:57:11,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:57:11,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:57:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:11,549 INFO L225 Difference]: With dead ends: 65918 [2019-12-07 10:57:11,550 INFO L226 Difference]: Without dead ends: 65918 [2019-12-07 10:57:11,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65918 states. [2019-12-07 10:57:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65918 to 58476. [2019-12-07 10:57:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58476 states. [2019-12-07 10:57:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58476 states to 58476 states and 193967 transitions. [2019-12-07 10:57:12,958 INFO L78 Accepts]: Start accepts. Automaton has 58476 states and 193967 transitions. Word has length 15 [2019-12-07 10:57:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:12,959 INFO L462 AbstractCegarLoop]: Abstraction has 58476 states and 193967 transitions. [2019-12-07 10:57:12,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:57:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 58476 states and 193967 transitions. [2019-12-07 10:57:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:57:12,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:12,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:12,963 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1418364262, now seen corresponding path program 1 times [2019-12-07 10:57:12,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:12,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486128821] [2019-12-07 10:57:12,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:13,012 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 10:57:13,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486128821] [2019-12-07 10:57:13,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:13,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:57:13,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672734247] [2019-12-07 10:57:13,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:57:13,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:13,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:57:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:13,014 INFO L87 Difference]: Start difference. First operand 58476 states and 193967 transitions. Second operand 3 states. [2019-12-07 10:57:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:13,199 INFO L93 Difference]: Finished difference Result 55330 states and 183290 transitions. [2019-12-07 10:57:13,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:57:13,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:57:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:13,298 INFO L225 Difference]: With dead ends: 55330 [2019-12-07 10:57:13,298 INFO L226 Difference]: Without dead ends: 55330 [2019-12-07 10:57:13,298 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 10:57:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55330 states. [2019-12-07 10:57:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55330 to 55330. [2019-12-07 10:57:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55330 states. [2019-12-07 10:57:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55330 states to 55330 states and 183290 transitions. [2019-12-07 10:57:14,521 INFO L78 Accepts]: Start accepts. Automaton has 55330 states and 183290 transitions. Word has length 16 [2019-12-07 10:57:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:14,522 INFO L462 AbstractCegarLoop]: Abstraction has 55330 states and 183290 transitions. [2019-12-07 10:57:14,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:57:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states and 183290 transitions. [2019-12-07 10:57:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:57:14,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:14,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:14,528 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash 285364695, now seen corresponding path program 1 times [2019-12-07 10:57:14,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:14,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115904539] [2019-12-07 10:57:14,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:14,571 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 10:57:14,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115904539] [2019-12-07 10:57:14,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:14,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:57:14,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62285354] [2019-12-07 10:57:14,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:57:14,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:14,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:57:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:57:14,572 INFO L87 Difference]: Start difference. First operand 55330 states and 183290 transitions. Second operand 4 states. [2019-12-07 10:57:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:14,964 INFO L93 Difference]: Finished difference Result 68586 states and 223928 transitions. [2019-12-07 10:57:14,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:57:14,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 10:57:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:15,079 INFO L225 Difference]: With dead ends: 68586 [2019-12-07 10:57:15,079 INFO L226 Difference]: Without dead ends: 68569 [2019-12-07 10:57:15,080 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 10:57:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68569 states. [2019-12-07 10:57:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68569 to 56099. [2019-12-07 10:57:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56099 states. [2019-12-07 10:57:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56099 states to 56099 states and 185794 transitions. [2019-12-07 10:57:16,433 INFO L78 Accepts]: Start accepts. Automaton has 56099 states and 185794 transitions. Word has length 17 [2019-12-07 10:57:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:16,433 INFO L462 AbstractCegarLoop]: Abstraction has 56099 states and 185794 transitions. [2019-12-07 10:57:16,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:57:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 56099 states and 185794 transitions. [2019-12-07 10:57:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:57:16,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:16,443 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 10:57:16,443 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -762555601, now seen corresponding path program 1 times [2019-12-07 10:57:16,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:16,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924249943] [2019-12-07 10:57:16,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:16,482 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 10:57:16,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924249943] [2019-12-07 10:57:16,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:16,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:57:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887917859] [2019-12-07 10:57:16,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:57:16,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:16,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:57:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:57:16,484 INFO L87 Difference]: Start difference. First operand 56099 states and 185794 transitions. Second operand 5 states. [2019-12-07 10:57:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:17,127 INFO L93 Difference]: Finished difference Result 78809 states and 254697 transitions. [2019-12-07 10:57:17,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:57:17,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 10:57:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:17,259 INFO L225 Difference]: With dead ends: 78809 [2019-12-07 10:57:17,259 INFO L226 Difference]: Without dead ends: 78795 [2019-12-07 10:57:17,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:57:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78795 states. [2019-12-07 10:57:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78795 to 61307. [2019-12-07 10:57:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61307 states. [2019-12-07 10:57:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61307 states to 61307 states and 202072 transitions. [2019-12-07 10:57:18,800 INFO L78 Accepts]: Start accepts. Automaton has 61307 states and 202072 transitions. Word has length 20 [2019-12-07 10:57:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:18,800 INFO L462 AbstractCegarLoop]: Abstraction has 61307 states and 202072 transitions. [2019-12-07 10:57:18,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:57:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61307 states and 202072 transitions. [2019-12-07 10:57:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:57:18,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:18,817 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 10:57:18,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash -915737050, now seen corresponding path program 1 times [2019-12-07 10:57:18,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:18,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429139736] [2019-12-07 10:57:18,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:18,858 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 10:57:18,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429139736] [2019-12-07 10:57:18,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:18,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:57:18,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436921758] [2019-12-07 10:57:18,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:57:18,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:57:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:57:18,860 INFO L87 Difference]: Start difference. First operand 61307 states and 202072 transitions. Second operand 4 states. [2019-12-07 10:57:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:18,903 INFO L93 Difference]: Finished difference Result 11362 states and 30298 transitions. [2019-12-07 10:57:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:57:18,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 10:57:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:18,910 INFO L225 Difference]: With dead ends: 11362 [2019-12-07 10:57:18,910 INFO L226 Difference]: Without dead ends: 7054 [2019-12-07 10:57:18,910 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 10:57:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-12-07 10:57:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 7010. [2019-12-07 10:57:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-12-07 10:57:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 16196 transitions. [2019-12-07 10:57:18,977 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 16196 transitions. Word has length 23 [2019-12-07 10:57:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:18,977 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 16196 transitions. [2019-12-07 10:57:18,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:57:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 16196 transitions. [2019-12-07 10:57:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:57:18,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:18,981 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 10:57:18,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash 484194479, now seen corresponding path program 1 times [2019-12-07 10:57:18,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:18,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907546299] [2019-12-07 10:57:18,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:19,010 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 10:57:19,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907546299] [2019-12-07 10:57:19,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:19,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:57:19,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997672395] [2019-12-07 10:57:19,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:57:19,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:19,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:57:19,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:19,012 INFO L87 Difference]: Start difference. First operand 7010 states and 16196 transitions. Second operand 3 states. [2019-12-07 10:57:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:19,060 INFO L93 Difference]: Finished difference Result 7678 states and 16747 transitions. [2019-12-07 10:57:19,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:57:19,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 10:57:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:19,065 INFO L225 Difference]: With dead ends: 7678 [2019-12-07 10:57:19,065 INFO L226 Difference]: Without dead ends: 7678 [2019-12-07 10:57:19,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7678 states. [2019-12-07 10:57:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7678 to 7092. [2019-12-07 10:57:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7092 states. [2019-12-07 10:57:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7092 states to 7092 states and 15530 transitions. [2019-12-07 10:57:19,135 INFO L78 Accepts]: Start accepts. Automaton has 7092 states and 15530 transitions. Word has length 31 [2019-12-07 10:57:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:19,135 INFO L462 AbstractCegarLoop]: Abstraction has 7092 states and 15530 transitions. [2019-12-07 10:57:19,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:57:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7092 states and 15530 transitions. [2019-12-07 10:57:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:57:19,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:19,140 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] [2019-12-07 10:57:19,140 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1443742418, now seen corresponding path program 1 times [2019-12-07 10:57:19,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:19,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310970276] [2019-12-07 10:57:19,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:19,179 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 10:57:19,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310970276] [2019-12-07 10:57:19,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:19,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:57:19,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382729848] [2019-12-07 10:57:19,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:57:19,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:57:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:57:19,180 INFO L87 Difference]: Start difference. First operand 7092 states and 15530 transitions. Second operand 5 states. [2019-12-07 10:57:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:19,397 INFO L93 Difference]: Finished difference Result 8001 states and 17262 transitions. [2019-12-07 10:57:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:57:19,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:57:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:19,403 INFO L225 Difference]: With dead ends: 8001 [2019-12-07 10:57:19,404 INFO L226 Difference]: Without dead ends: 8000 [2019-12-07 10:57:19,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:57:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2019-12-07 10:57:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 6268. [2019-12-07 10:57:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6268 states. [2019-12-07 10:57:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13863 transitions. [2019-12-07 10:57:19,469 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13863 transitions. Word has length 34 [2019-12-07 10:57:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:19,469 INFO L462 AbstractCegarLoop]: Abstraction has 6268 states and 13863 transitions. [2019-12-07 10:57:19,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:57:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13863 transitions. [2019-12-07 10:57:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:57:19,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:19,476 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] [2019-12-07 10:57:19,476 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash -774360428, now seen corresponding path program 1 times [2019-12-07 10:57:19,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:19,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976527441] [2019-12-07 10:57:19,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:19,532 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 10:57:19,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976527441] [2019-12-07 10:57:19,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:19,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:57:19,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164224264] [2019-12-07 10:57:19,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:57:19,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:57:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:57:19,534 INFO L87 Difference]: Start difference. First operand 6268 states and 13863 transitions. Second operand 5 states. [2019-12-07 10:57:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:19,785 INFO L93 Difference]: Finished difference Result 7377 states and 16102 transitions. [2019-12-07 10:57:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:57:19,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 10:57:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:19,791 INFO L225 Difference]: With dead ends: 7377 [2019-12-07 10:57:19,791 INFO L226 Difference]: Without dead ends: 7377 [2019-12-07 10:57:19,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:57:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2019-12-07 10:57:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 7033. [2019-12-07 10:57:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7033 states. [2019-12-07 10:57:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7033 states to 7033 states and 15435 transitions. [2019-12-07 10:57:19,860 INFO L78 Accepts]: Start accepts. Automaton has 7033 states and 15435 transitions. Word has length 41 [2019-12-07 10:57:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:19,860 INFO L462 AbstractCegarLoop]: Abstraction has 7033 states and 15435 transitions. [2019-12-07 10:57:19,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:57:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7033 states and 15435 transitions. [2019-12-07 10:57:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:57:19,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:19,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:19,869 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:19,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:19,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2144525389, now seen corresponding path program 1 times [2019-12-07 10:57:19,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:19,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657616679] [2019-12-07 10:57:19,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:19,908 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 10:57:19,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657616679] [2019-12-07 10:57:19,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:19,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:57:19,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115257476] [2019-12-07 10:57:19,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:57:19,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:57:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:57:19,909 INFO L87 Difference]: Start difference. First operand 7033 states and 15435 transitions. Second operand 3 states. [2019-12-07 10:57:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:19,932 INFO L93 Difference]: Finished difference Result 6881 states and 14956 transitions. [2019-12-07 10:57:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:57:19,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 10:57:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:19,938 INFO L225 Difference]: With dead ends: 6881 [2019-12-07 10:57:19,938 INFO L226 Difference]: Without dead ends: 6881 [2019-12-07 10:57:19,938 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 10:57:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2019-12-07 10:57:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 6474. [2019-12-07 10:57:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6474 states. [2019-12-07 10:57:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 14144 transitions. [2019-12-07 10:57:19,999 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 14144 transitions. Word has length 42 [2019-12-07 10:57:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:19,999 INFO L462 AbstractCegarLoop]: Abstraction has 6474 states and 14144 transitions. [2019-12-07 10:57:19,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:57:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 14144 transitions. [2019-12-07 10:57:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:57:20,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:20,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:20,005 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash 630649324, now seen corresponding path program 1 times [2019-12-07 10:57:20,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:20,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663985753] [2019-12-07 10:57:20,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:20,204 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 10:57:20,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663985753] [2019-12-07 10:57:20,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:20,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:57:20,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277484403] [2019-12-07 10:57:20,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:57:20,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:57:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:57:20,205 INFO L87 Difference]: Start difference. First operand 6474 states and 14144 transitions. Second operand 11 states. [2019-12-07 10:57:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:21,637 INFO L93 Difference]: Finished difference Result 13028 states and 28232 transitions. [2019-12-07 10:57:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:57:21,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-07 10:57:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:21,645 INFO L225 Difference]: With dead ends: 13028 [2019-12-07 10:57:21,645 INFO L226 Difference]: Without dead ends: 10896 [2019-12-07 10:57:21,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:57:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10896 states. [2019-12-07 10:57:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10896 to 10098. [2019-12-07 10:57:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-12-07 10:57:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 22123 transitions. [2019-12-07 10:57:21,744 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 22123 transitions. Word has length 42 [2019-12-07 10:57:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:21,744 INFO L462 AbstractCegarLoop]: Abstraction has 10098 states and 22123 transitions. [2019-12-07 10:57:21,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:57:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 22123 transitions. [2019-12-07 10:57:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:57:21,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:21,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:21,755 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2031288696, now seen corresponding path program 1 times [2019-12-07 10:57:21,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:21,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026389344] [2019-12-07 10:57:21,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:21,803 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 10:57:21,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026389344] [2019-12-07 10:57:21,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:21,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:57:21,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474760975] [2019-12-07 10:57:21,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:57:21,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:57:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:57:21,804 INFO L87 Difference]: Start difference. First operand 10098 states and 22123 transitions. Second operand 5 states. [2019-12-07 10:57:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:21,841 INFO L93 Difference]: Finished difference Result 7130 states and 15689 transitions. [2019-12-07 10:57:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:57:21,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 10:57:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:21,846 INFO L225 Difference]: With dead ends: 7130 [2019-12-07 10:57:21,846 INFO L226 Difference]: Without dead ends: 6790 [2019-12-07 10:57:21,847 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 10:57:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-12-07 10:57:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6367. [2019-12-07 10:57:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6367 states. [2019-12-07 10:57:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6367 states to 6367 states and 14133 transitions. [2019-12-07 10:57:21,905 INFO L78 Accepts]: Start accepts. Automaton has 6367 states and 14133 transitions. Word has length 43 [2019-12-07 10:57:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:21,906 INFO L462 AbstractCegarLoop]: Abstraction has 6367 states and 14133 transitions. [2019-12-07 10:57:21,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:57:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6367 states and 14133 transitions. [2019-12-07 10:57:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:57:21,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:21,913 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] [2019-12-07 10:57:21,913 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:21,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2087830626, now seen corresponding path program 1 times [2019-12-07 10:57:21,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:21,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184989035] [2019-12-07 10:57:21,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:22,096 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 10:57:22,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184989035] [2019-12-07 10:57:22,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:22,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:57:22,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248220526] [2019-12-07 10:57:22,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:57:22,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:57:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:57:22,098 INFO L87 Difference]: Start difference. First operand 6367 states and 14133 transitions. Second operand 12 states. [2019-12-07 10:57:22,527 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-12-07 10:57:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:23,185 INFO L93 Difference]: Finished difference Result 11411 states and 25257 transitions. [2019-12-07 10:57:23,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:57:23,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-07 10:57:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:23,194 INFO L225 Difference]: With dead ends: 11411 [2019-12-07 10:57:23,194 INFO L226 Difference]: Without dead ends: 11172 [2019-12-07 10:57:23,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 10:57:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11172 states. [2019-12-07 10:57:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11172 to 7236. [2019-12-07 10:57:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7236 states. [2019-12-07 10:57:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 16051 transitions. [2019-12-07 10:57:23,278 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 16051 transitions. Word has length 59 [2019-12-07 10:57:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:23,278 INFO L462 AbstractCegarLoop]: Abstraction has 7236 states and 16051 transitions. [2019-12-07 10:57:23,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:57:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 16051 transitions. [2019-12-07 10:57:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:57:23,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:23,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:23,286 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2019506104, now seen corresponding path program 2 times [2019-12-07 10:57:23,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:23,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943337477] [2019-12-07 10:57:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:23,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 10:57:23,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943337477] [2019-12-07 10:57:23,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:23,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:57:23,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724175780] [2019-12-07 10:57:23,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:57:23,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:57:23,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:57:23,511 INFO L87 Difference]: Start difference. First operand 7236 states and 16051 transitions. Second operand 14 states. [2019-12-07 10:57:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:26,056 INFO L93 Difference]: Finished difference Result 12149 states and 26813 transitions. [2019-12-07 10:57:26,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 10:57:26,057 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-12-07 10:57:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:26,080 INFO L225 Difference]: With dead ends: 12149 [2019-12-07 10:57:26,080 INFO L226 Difference]: Without dead ends: 11131 [2019-12-07 10:57:26,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 10:57:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11131 states. [2019-12-07 10:57:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11131 to 7457. [2019-12-07 10:57:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7457 states. [2019-12-07 10:57:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 16520 transitions. [2019-12-07 10:57:26,176 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 16520 transitions. Word has length 59 [2019-12-07 10:57:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:26,176 INFO L462 AbstractCegarLoop]: Abstraction has 7457 states and 16520 transitions. [2019-12-07 10:57:26,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:57:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 16520 transitions. [2019-12-07 10:57:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:57:26,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:26,182 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] [2019-12-07 10:57:26,182 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1112240532, now seen corresponding path program 3 times [2019-12-07 10:57:26,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:26,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083652364] [2019-12-07 10:57:26,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:57:26,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083652364] [2019-12-07 10:57:26,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:57:26,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341033441] [2019-12-07 10:57:26,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:57:26,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:57:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:57:26,304 INFO L87 Difference]: Start difference. First operand 7457 states and 16520 transitions. Second operand 11 states. [2019-12-07 10:57:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:27,591 INFO L93 Difference]: Finished difference Result 7766 states and 17064 transitions. [2019-12-07 10:57:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:57:27,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 10:57:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:27,597 INFO L225 Difference]: With dead ends: 7766 [2019-12-07 10:57:27,597 INFO L226 Difference]: Without dead ends: 7693 [2019-12-07 10:57:27,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:57:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2019-12-07 10:57:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 5161. [2019-12-07 10:57:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-12-07 10:57:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11446 transitions. [2019-12-07 10:57:27,652 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11446 transitions. Word has length 59 [2019-12-07 10:57:27,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:27,652 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11446 transitions. [2019-12-07 10:57:27,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:57:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11446 transitions. [2019-12-07 10:57:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:57:27,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:27,655 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] [2019-12-07 10:57:27,656 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 6841022, now seen corresponding path program 4 times [2019-12-07 10:57:27,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:27,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858269630] [2019-12-07 10:57:27,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:27,694 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 10:57:27,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858269630] [2019-12-07 10:57:27,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:57:27,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:57:27,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046986545] [2019-12-07 10:57:27,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:57:27,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:57:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:57:27,696 INFO L87 Difference]: Start difference. First operand 5161 states and 11446 transitions. Second operand 4 states. [2019-12-07 10:57:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:27,716 INFO L93 Difference]: Finished difference Result 5849 states and 12882 transitions. [2019-12-07 10:57:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:57:27,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 10:57:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:27,717 INFO L225 Difference]: With dead ends: 5849 [2019-12-07 10:57:27,717 INFO L226 Difference]: Without dead ends: 751 [2019-12-07 10:57:27,717 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 10:57:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-07 10:57:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2019-12-07 10:57:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-12-07 10:57:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1521 transitions. [2019-12-07 10:57:27,723 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1521 transitions. Word has length 59 [2019-12-07 10:57:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:27,724 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1521 transitions. [2019-12-07 10:57:27,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:57:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1521 transitions. [2019-12-07 10:57:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:57:27,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:27,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:27,724 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:57:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1424316398, now seen corresponding path program 1 times [2019-12-07 10:57:27,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:27,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570135763] [2019-12-07 10:57:27,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:57:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:57:27,792 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:57:27,792 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:57:27,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x$w_buff0~0_184) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35|)) (= v_~x$r_buff0_thd0~0_104 0) (= v_~x$flush_delayed~0_211 0) (= 0 v_~x$w_buff1~0_179) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= 0 v_~x~0_237) (= 0 v_~x$mem_tmp~0_172) (= 0 v_~x$r_buff1_thd2~0_289) (= v_~y~0_71 0) (= v_~__unbuffered_p1_EBX~0_59 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_39 0) (= 0 v_~__unbuffered_cnt~0_51) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_189 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_243 0) (= v_~main$tmp_guard0~0_35 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_431) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_35|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_35| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35| 1) |v_#valid_53|) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~x$r_buff0_thd2~0_420) (= v_~x$r_buff1_thd1~0_241 0) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_25|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$w_buff0_used~0_795) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35|) |v_ULTIMATE.start_main_~#t311~0.offset_25| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ~x$flush_delayed~0=v_~x$flush_delayed~0_211, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~x$mem_tmp~0=v_~x$mem_tmp~0_172, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_19|, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_179, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_169|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_35, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_189, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_420, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_79|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_229|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_27|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_243, ~x~0=v_~x~0_237, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:57:27,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-07 10:57:27,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 1 v_~x$w_buff0~0_24) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_76 256))) (not (= 0 (mod v_~x$w_buff0_used~0_123 256))))) 1 0)) (= 1 v_~x$w_buff0_used~0_123) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_31) (= v_~x$w_buff1_used~0_76 v_~x$w_buff0_used~0_124) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 10:57:27,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1225609881 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1225609881 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out1225609881| ~x$w_buff1~0_In1225609881) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1225609881| ~x$w_buff0~0_In1225609881) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1225609881, ~x$w_buff1~0=~x$w_buff1~0_In1225609881, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1225609881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1225609881} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1225609881, ~x$w_buff1~0=~x$w_buff1~0_In1225609881, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1225609881, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1225609881|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1225609881} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:57:27,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_35 |v_P1Thread1of1ForFork1_#t~ite28_12|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_12|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_35, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:57:27,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff0_thd2~0_205) (not (= 0 (mod v_~weak$$choice2~0_111 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~weak$$choice2~0=v_~weak$$choice2~0_111} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_11|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_8|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_10|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:57:27,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1163946561 256) 0))) (or (and (= ~x~0_In1163946561 |P1Thread1of1ForFork1_#t~ite48_Out1163946561|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1163946561| ~x$mem_tmp~0_In1163946561) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1163946561, ~x$mem_tmp~0=~x$mem_tmp~0_In1163946561, ~x~0=~x~0_In1163946561} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1163946561, ~x$mem_tmp~0=~x$mem_tmp~0_In1163946561, ~x~0=~x~0_In1163946561, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1163946561|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:57:27,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1363403590 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1363403590| ~x$mem_tmp~0_In1363403590)) (and (= ~x~0_In1363403590 |P0Thread1of1ForFork0_#t~ite25_Out1363403590|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1363403590, ~x$mem_tmp~0=~x$mem_tmp~0_In1363403590, ~x~0=~x~0_In1363403590} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1363403590|, ~x$flush_delayed~0=~x$flush_delayed~0_In1363403590, ~x$mem_tmp~0=~x$mem_tmp~0_In1363403590, ~x~0=~x~0_In1363403590} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:57:27,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_109) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:57:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1791697233 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1791697233 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out1791697233| 0)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out1791697233| ~x$w_buff0_used~0_In1791697233) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1791697233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791697233} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1791697233|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1791697233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791697233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:57:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2068529410 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2068529410 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-2068529410 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2068529410 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out-2068529410| 0)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-2068529410| ~x$w_buff1_used~0_In-2068529410) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068529410, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2068529410, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2068529410, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068529410} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-2068529410|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068529410, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2068529410, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2068529410, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068529410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:57:27,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In449978037 ~x$r_buff0_thd2~0_Out449978037)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In449978037 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In449978037 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~x$r_buff0_thd2~0_Out449978037) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In449978037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In449978037} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out449978037|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out449978037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In449978037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:57:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In690462711 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In690462711 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In690462711 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In690462711 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out690462711|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In690462711 |P1Thread1of1ForFork1_#t~ite54_Out690462711|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In690462711, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In690462711, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In690462711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690462711} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In690462711, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In690462711, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out690462711|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In690462711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690462711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:57:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_141 |v_P1Thread1of1ForFork1_#t~ite54_18|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:57:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_229 256)) (= (mod v_~x$r_buff0_thd0~0_27 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:57:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In955895909 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In955895909 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite57_Out955895909| ~x$w_buff1~0_In955895909)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out955895909| ~x~0_In955895909)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In955895909, ~x$w_buff1_used~0=~x$w_buff1_used~0_In955895909, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In955895909, ~x~0=~x~0_In955895909} OutVars{~x$w_buff1~0=~x$w_buff1~0_In955895909, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out955895909|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In955895909, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In955895909, ~x~0=~x~0_In955895909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:57:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_76 |v_ULTIMATE.start_main_#t~ite57_12|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~x~0=v_~x~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-07 10:57:27,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1468235711 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1468235711 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out1468235711|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1468235711| ~x$w_buff0_used~0_In1468235711)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1468235711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468235711} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1468235711, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1468235711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468235711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:57:27,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2050215723 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2050215723 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2050215723 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2050215723 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite60_Out2050215723|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2050215723 |ULTIMATE.start_main_#t~ite60_Out2050215723|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2050215723, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2050215723, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2050215723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050215723} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2050215723, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2050215723|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2050215723, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2050215723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050215723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:57:27,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-911441790 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-911441790 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-911441790| ~x$r_buff0_thd0~0_In-911441790) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-911441790| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-911441790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-911441790} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-911441790, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-911441790|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-911441790} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:57:27,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1480917864 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1480917864 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1480917864 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1480917864 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1480917864| ~x$r_buff1_thd0~0_In-1480917864) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1480917864| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1480917864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480917864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1480917864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1480917864} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1480917864|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1480917864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480917864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1480917864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1480917864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:57:27,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_35 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~x$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite62_47|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:57:27,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:57:27 BasicIcfg [2019-12-07 10:57:27,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:57:27,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:57:27,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:57:27,872 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:57:27,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:57:02" (3/4) ... [2019-12-07 10:57:27,873 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:57:27,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x$w_buff0~0_184) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35|)) (= v_~x$r_buff0_thd0~0_104 0) (= v_~x$flush_delayed~0_211 0) (= 0 v_~x$w_buff1~0_179) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= 0 v_~x~0_237) (= 0 v_~x$mem_tmp~0_172) (= 0 v_~x$r_buff1_thd2~0_289) (= v_~y~0_71 0) (= v_~__unbuffered_p1_EBX~0_59 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_39 0) (= 0 v_~__unbuffered_cnt~0_51) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_189 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_243 0) (= v_~main$tmp_guard0~0_35 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_431) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_35|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_35| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35| 1) |v_#valid_53|) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~x$r_buff0_thd2~0_420) (= v_~x$r_buff1_thd1~0_241 0) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_25|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$w_buff0_used~0_795) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35|) |v_ULTIMATE.start_main_~#t311~0.offset_25| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ~x$flush_delayed~0=v_~x$flush_delayed~0_211, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~x$mem_tmp~0=v_~x$mem_tmp~0_172, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_19|, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_179, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_169|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_35, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_189, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_420, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_79|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_229|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_27|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_243, ~x~0=v_~x~0_237, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:57:27,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-07 10:57:27,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 1 v_~x$w_buff0~0_24) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_76 256))) (not (= 0 (mod v_~x$w_buff0_used~0_123 256))))) 1 0)) (= 1 v_~x$w_buff0_used~0_123) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_31) (= v_~x$w_buff1_used~0_76 v_~x$w_buff0_used~0_124) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 10:57:27,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1225609881 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1225609881 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out1225609881| ~x$w_buff1~0_In1225609881) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1225609881| ~x$w_buff0~0_In1225609881) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1225609881, ~x$w_buff1~0=~x$w_buff1~0_In1225609881, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1225609881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1225609881} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1225609881, ~x$w_buff1~0=~x$w_buff1~0_In1225609881, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1225609881, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1225609881|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1225609881} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:57:27,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_35 |v_P1Thread1of1ForFork1_#t~ite28_12|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_12|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_35, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:57:27,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff0_thd2~0_205) (not (= 0 (mod v_~weak$$choice2~0_111 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~weak$$choice2~0=v_~weak$$choice2~0_111} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_11|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_8|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_10|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:57:27,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1163946561 256) 0))) (or (and (= ~x~0_In1163946561 |P1Thread1of1ForFork1_#t~ite48_Out1163946561|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1163946561| ~x$mem_tmp~0_In1163946561) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1163946561, ~x$mem_tmp~0=~x$mem_tmp~0_In1163946561, ~x~0=~x~0_In1163946561} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1163946561, ~x$mem_tmp~0=~x$mem_tmp~0_In1163946561, ~x~0=~x~0_In1163946561, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1163946561|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:57:27,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1363403590 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1363403590| ~x$mem_tmp~0_In1363403590)) (and (= ~x~0_In1363403590 |P0Thread1of1ForFork0_#t~ite25_Out1363403590|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1363403590, ~x$mem_tmp~0=~x$mem_tmp~0_In1363403590, ~x~0=~x~0_In1363403590} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1363403590|, ~x$flush_delayed~0=~x$flush_delayed~0_In1363403590, ~x$mem_tmp~0=~x$mem_tmp~0_In1363403590, ~x~0=~x~0_In1363403590} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:57:27,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_109) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:57:27,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1791697233 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1791697233 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out1791697233| 0)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out1791697233| ~x$w_buff0_used~0_In1791697233) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1791697233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791697233} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1791697233|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1791697233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791697233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:57:27,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2068529410 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2068529410 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-2068529410 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2068529410 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out-2068529410| 0)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-2068529410| ~x$w_buff1_used~0_In-2068529410) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068529410, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2068529410, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2068529410, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068529410} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-2068529410|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068529410, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2068529410, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2068529410, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068529410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:57:27,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In449978037 ~x$r_buff0_thd2~0_Out449978037)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In449978037 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In449978037 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~x$r_buff0_thd2~0_Out449978037) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In449978037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In449978037} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out449978037|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out449978037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In449978037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:57:27,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In690462711 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In690462711 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In690462711 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In690462711 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out690462711|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In690462711 |P1Thread1of1ForFork1_#t~ite54_Out690462711|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In690462711, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In690462711, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In690462711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690462711} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In690462711, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In690462711, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out690462711|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In690462711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690462711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:57:27,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_141 |v_P1Thread1of1ForFork1_#t~ite54_18|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:57:27,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_229 256)) (= (mod v_~x$r_buff0_thd0~0_27 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:57:27,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In955895909 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In955895909 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite57_Out955895909| ~x$w_buff1~0_In955895909)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out955895909| ~x~0_In955895909)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In955895909, ~x$w_buff1_used~0=~x$w_buff1_used~0_In955895909, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In955895909, ~x~0=~x~0_In955895909} OutVars{~x$w_buff1~0=~x$w_buff1~0_In955895909, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out955895909|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In955895909, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In955895909, ~x~0=~x~0_In955895909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:57:27,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_76 |v_ULTIMATE.start_main_#t~ite57_12|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~x~0=v_~x~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-07 10:57:27,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1468235711 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1468235711 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out1468235711|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1468235711| ~x$w_buff0_used~0_In1468235711)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1468235711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468235711} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1468235711, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1468235711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468235711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:57:27,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2050215723 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2050215723 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2050215723 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2050215723 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite60_Out2050215723|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2050215723 |ULTIMATE.start_main_#t~ite60_Out2050215723|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2050215723, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2050215723, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2050215723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050215723} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2050215723, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2050215723|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2050215723, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2050215723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050215723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:57:27,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-911441790 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-911441790 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-911441790| ~x$r_buff0_thd0~0_In-911441790) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-911441790| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-911441790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-911441790} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-911441790, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-911441790|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-911441790} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:57:27,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1480917864 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1480917864 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1480917864 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1480917864 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1480917864| ~x$r_buff1_thd0~0_In-1480917864) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1480917864| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1480917864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480917864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1480917864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1480917864} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1480917864|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1480917864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480917864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1480917864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1480917864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:57:27,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_35 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~x$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite62_47|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:57:27,958 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e4742ce4-f54b-434b-9951-c7b934b552ce/bin/uautomizer/witness.graphml [2019-12-07 10:57:27,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:57:27,960 INFO L168 Benchmark]: Toolchain (without parser) took 26780.76 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 942.5 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 541.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,960 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:57:27,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,961 INFO L168 Benchmark]: Boogie Preprocessor took 30.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,961 INFO L168 Benchmark]: RCFGBuilder took 435.42 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,961 INFO L168 Benchmark]: TraceAbstraction took 25791.31 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 486.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,962 INFO L168 Benchmark]: Witness Printer took 87.20 ms. Allocated memory is still 3.3 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:57:27,963 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.42 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25791.31 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 486.3 MB. Max. memory is 11.5 GB. * Witness Printer took 87.20 ms. Allocated memory is still 3.3 GB. Free memory was 2.7 GB in the beginning and 2.6 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.1s, 178 ProgramPointsBefore, 103 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 29 ChoiceCompositions, 8870 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 290 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 122314 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4061 SDtfs, 5670 SDslu, 11800 SDs, 0 SdLazy, 7167 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61307occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 57147 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 182840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...