./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_rmo.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_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/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 66a74c6acc251b811b9cfc3b5d3a17dc245313da ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:10:17,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:10:17,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:10:17,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:10:17,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:10:17,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:10:17,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:10:17,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:10:17,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:10:17,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:10:17,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:10:17,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:10:17,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:10:17,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:10:17,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:10:17,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:10:17,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:10:17,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:10:17,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:10:17,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:10:17,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:10:17,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:10:17,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:10:17,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:10:17,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:10:17,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:10:17,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:10:17,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:10:17,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:10:17,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:10:17,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:10:17,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:10:17,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:10:17,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:10:17,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:10:17,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:10:17,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:10:17,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:10:17,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:10:17,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:10:17,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:10:17,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:10:17,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:10:17,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:10:17,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:10:17,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:10:17,577 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:10:17,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:10:17,578 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:10:17,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:10:17,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:10:17,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:10:17,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:10:17,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:10:17,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:10:17,579 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:10:17,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:10:17,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:10:17,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:10:17,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:10:17,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:10:17,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:10:17,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:10:17,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:10:17,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:10:17,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:10:17,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:10:17,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:10:17,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:10:17,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:10:17,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:10:17,582 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_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/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 -> 66a74c6acc251b811b9cfc3b5d3a17dc245313da [2019-12-07 18:10:17,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:10:17,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:10:17,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:10:17,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:10:17,693 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:10:17,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe021_rmo.opt.i [2019-12-07 18:10:17,730 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/data/d69277123/8de0e1e7952d415ca653cced06af5b1a/FLAG4ca20887e [2019-12-07 18:10:18,193 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:10:18,193 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/sv-benchmarks/c/pthread-wmm/safe021_rmo.opt.i [2019-12-07 18:10:18,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/data/d69277123/8de0e1e7952d415ca653cced06af5b1a/FLAG4ca20887e [2019-12-07 18:10:18,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/data/d69277123/8de0e1e7952d415ca653cced06af5b1a [2019-12-07 18:10:18,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:10:18,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:10:18,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:10:18,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:10:18,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:10:18,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:10:18" (1/1) ... [2019-12-07 18:10:18,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:18, skipping insertion in model container [2019-12-07 18:10:18,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:10:18" (1/1) ... [2019-12-07 18:10:18,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:10:18,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:10:19,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:10:19,019 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:10:19,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:10:19,106 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:10:19,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19 WrapperNode [2019-12-07 18:10:19,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:10:19,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:10:19,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:10:19,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:10:19,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:10:19,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:10:19,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:10:19,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:10:19,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... [2019-12-07 18:10:19,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:10:19,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:10:19,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:10:19,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:10:19,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:10:19,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:10:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:10:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:10:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:10:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:10:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:10:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:10:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:10:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:10:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:10:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:10:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:10:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:10:19,240 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:10:19,620 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:10:19,620 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:10:19,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:19 BoogieIcfgContainer [2019-12-07 18:10:19,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:10:19,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:10:19,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:10:19,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:10:19,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:10:18" (1/3) ... [2019-12-07 18:10:19,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd71ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:10:19, skipping insertion in model container [2019-12-07 18:10:19,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:10:19" (2/3) ... [2019-12-07 18:10:19,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd71ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:10:19, skipping insertion in model container [2019-12-07 18:10:19,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:19" (3/3) ... [2019-12-07 18:10:19,627 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i [2019-12-07 18:10:19,634 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:10:19,634 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:10:19,639 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:10:19,639 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:10:19,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,671 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,671 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,678 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,678 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:10:19,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:10:19,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:10:19,724 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:10:19,724 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:10:19,724 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:10:19,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:10:19,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:10:19,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:10:19,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:10:19,735 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-07 18:10:19,736 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 18:10:19,800 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 18:10:19,800 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:10:19,810 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 18:10:19,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 18:10:19,857 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 18:10:19,857 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:10:19,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 18:10:19,879 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 18:10:19,879 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:10:23,043 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 18:10:23,312 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-07 18:10:23,312 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 18:10:23,314 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-07 18:10:37,645 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-07 18:10:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-07 18:10:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:10:37,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:37,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:10:37,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-07 18:10:37,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:37,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620757400] [2019-12-07 18:10:37,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:37,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620757400] [2019-12-07 18:10:37,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:37,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:10:37,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754417987] [2019-12-07 18:10:37,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:10:37,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:37,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:10:37,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:37,801 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-07 18:10:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:38,610 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-07 18:10:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:10:38,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:10:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:39,034 INFO L225 Difference]: With dead ends: 110910 [2019-12-07 18:10:39,034 INFO L226 Difference]: Without dead ends: 98066 [2019-12-07 18:10:39,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:10:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-07 18:10:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-07 18:10:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-07 18:10:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-07 18:10:43,860 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-07 18:10:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-07 18:10:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:10:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-07 18:10:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:10:43,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:43,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:43,864 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-07 18:10:43,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:43,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285121546] [2019-12-07 18:10:43,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:43,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285121546] [2019-12-07 18:10:43,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:43,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:10:43,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159811909] [2019-12-07 18:10:43,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:10:43,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:10:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:10:43,926 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-07 18:10:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:46,713 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-07 18:10:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:10:46,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:10:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:47,086 INFO L225 Difference]: With dead ends: 156656 [2019-12-07 18:10:47,086 INFO L226 Difference]: Without dead ends: 156558 [2019-12-07 18:10:47,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:10:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-07 18:10:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-07 18:10:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-07 18:10:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-07 18:10:53,221 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-07 18:10:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:10:53,221 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-07 18:10:53,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:10:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-07 18:10:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:10:53,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:10:53,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:10:53,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:10:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:10:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-07 18:10:53,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:10:53,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695394556] [2019-12-07 18:10:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:10:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:10:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:10:53,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695394556] [2019-12-07 18:10:53,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:10:53,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:10:53,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545816486] [2019-12-07 18:10:53,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:10:53,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:10:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:10:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:10:53,275 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 4 states. [2019-12-07 18:10:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:10:54,269 INFO L93 Difference]: Finished difference Result 205190 states and 828176 transitions. [2019-12-07 18:10:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:10:54,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:10:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:10:54,809 INFO L225 Difference]: With dead ends: 205190 [2019-12-07 18:10:54,810 INFO L226 Difference]: Without dead ends: 205078 [2019-12-07 18:10:54,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205078 states. [2019-12-07 18:11:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205078 to 171310. [2019-12-07 18:11:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171310 states. [2019-12-07 18:11:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171310 states to 171310 states and 704416 transitions. [2019-12-07 18:11:03,859 INFO L78 Accepts]: Start accepts. Automaton has 171310 states and 704416 transitions. Word has length 13 [2019-12-07 18:11:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:03,860 INFO L462 AbstractCegarLoop]: Abstraction has 171310 states and 704416 transitions. [2019-12-07 18:11:03,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:11:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 171310 states and 704416 transitions. [2019-12-07 18:11:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:11:03,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:03,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:03,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-07 18:11:03,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:03,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677721302] [2019-12-07 18:11:03,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:03,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677721302] [2019-12-07 18:11:03,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:03,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:11:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848727153] [2019-12-07 18:11:03,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:11:03,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:11:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:03,919 INFO L87 Difference]: Start difference. First operand 171310 states and 704416 transitions. Second operand 5 states. [2019-12-07 18:11:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:05,429 INFO L93 Difference]: Finished difference Result 231848 states and 943034 transitions. [2019-12-07 18:11:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:11:05,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:11:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:05,995 INFO L225 Difference]: With dead ends: 231848 [2019-12-07 18:11:05,995 INFO L226 Difference]: Without dead ends: 231848 [2019-12-07 18:11:05,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:11:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231848 states. [2019-12-07 18:11:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231848 to 191437. [2019-12-07 18:11:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191437 states. [2019-12-07 18:11:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191437 states to 191437 states and 785356 transitions. [2019-12-07 18:11:17,158 INFO L78 Accepts]: Start accepts. Automaton has 191437 states and 785356 transitions. Word has length 16 [2019-12-07 18:11:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:17,158 INFO L462 AbstractCegarLoop]: Abstraction has 191437 states and 785356 transitions. [2019-12-07 18:11:17,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:11:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 191437 states and 785356 transitions. [2019-12-07 18:11:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:11:17,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:17,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:17,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1118041263, now seen corresponding path program 1 times [2019-12-07 18:11:17,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:17,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552256074] [2019-12-07 18:11:17,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:17,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552256074] [2019-12-07 18:11:17,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:17,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:11:17,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16502404] [2019-12-07 18:11:17,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:11:17,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:17,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:11:17,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:17,213 INFO L87 Difference]: Start difference. First operand 191437 states and 785356 transitions. Second operand 3 states. [2019-12-07 18:11:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:17,966 INFO L93 Difference]: Finished difference Result 191437 states and 777824 transitions. [2019-12-07 18:11:17,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:11:17,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:11:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:18,426 INFO L225 Difference]: With dead ends: 191437 [2019-12-07 18:11:18,426 INFO L226 Difference]: Without dead ends: 191437 [2019-12-07 18:11:18,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191437 states. [2019-12-07 18:11:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191437 to 188487. [2019-12-07 18:11:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188487 states. [2019-12-07 18:11:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188487 states to 188487 states and 766908 transitions. [2019-12-07 18:11:25,830 INFO L78 Accepts]: Start accepts. Automaton has 188487 states and 766908 transitions. Word has length 18 [2019-12-07 18:11:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:25,830 INFO L462 AbstractCegarLoop]: Abstraction has 188487 states and 766908 transitions. [2019-12-07 18:11:25,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:11:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 188487 states and 766908 transitions. [2019-12-07 18:11:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:11:25,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:25,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:25,840 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2016155527, now seen corresponding path program 1 times [2019-12-07 18:11:25,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:25,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661420991] [2019-12-07 18:11:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:25,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661420991] [2019-12-07 18:11:25,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:25,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:11:25,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625704906] [2019-12-07 18:11:25,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:11:25,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:11:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:25,871 INFO L87 Difference]: Start difference. First operand 188487 states and 766908 transitions. Second operand 3 states. [2019-12-07 18:11:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:25,975 INFO L93 Difference]: Finished difference Result 34742 states and 111649 transitions. [2019-12-07 18:11:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:11:25,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:11:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:26,021 INFO L225 Difference]: With dead ends: 34742 [2019-12-07 18:11:26,022 INFO L226 Difference]: Without dead ends: 34742 [2019-12-07 18:11:26,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34742 states. [2019-12-07 18:11:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34742 to 34742. [2019-12-07 18:11:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34742 states. [2019-12-07 18:11:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34742 states to 34742 states and 111649 transitions. [2019-12-07 18:11:26,546 INFO L78 Accepts]: Start accepts. Automaton has 34742 states and 111649 transitions. Word has length 18 [2019-12-07 18:11:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:26,546 INFO L462 AbstractCegarLoop]: Abstraction has 34742 states and 111649 transitions. [2019-12-07 18:11:26,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:11:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34742 states and 111649 transitions. [2019-12-07 18:11:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:11:26,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:26,551 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] [2019-12-07 18:11:26,551 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-07 18:11:26,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:26,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605339798] [2019-12-07 18:11:26,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:26,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605339798] [2019-12-07 18:11:26,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:26,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:11:26,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136577447] [2019-12-07 18:11:26,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:11:26,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:11:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:11:26,600 INFO L87 Difference]: Start difference. First operand 34742 states and 111649 transitions. Second operand 6 states. [2019-12-07 18:11:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:27,195 INFO L93 Difference]: Finished difference Result 54273 states and 169908 transitions. [2019-12-07 18:11:27,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:11:27,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 18:11:27,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:27,271 INFO L225 Difference]: With dead ends: 54273 [2019-12-07 18:11:27,272 INFO L226 Difference]: Without dead ends: 54259 [2019-12-07 18:11:27,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:11:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54259 states. [2019-12-07 18:11:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54259 to 35726. [2019-12-07 18:11:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35726 states. [2019-12-07 18:11:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35726 states to 35726 states and 114063 transitions. [2019-12-07 18:11:27,941 INFO L78 Accepts]: Start accepts. Automaton has 35726 states and 114063 transitions. Word has length 22 [2019-12-07 18:11:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:27,941 INFO L462 AbstractCegarLoop]: Abstraction has 35726 states and 114063 transitions. [2019-12-07 18:11:27,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:11:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35726 states and 114063 transitions. [2019-12-07 18:11:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:11:27,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:27,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:27,949 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-07 18:11:27,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:27,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011343290] [2019-12-07 18:11:27,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:27,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011343290] [2019-12-07 18:11:27,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:27,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:11:27,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050153515] [2019-12-07 18:11:27,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:11:27,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:27,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:11:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:27,996 INFO L87 Difference]: Start difference. First operand 35726 states and 114063 transitions. Second operand 5 states. [2019-12-07 18:11:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:28,370 INFO L93 Difference]: Finished difference Result 50889 states and 159179 transitions. [2019-12-07 18:11:28,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:11:28,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:11:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:28,443 INFO L225 Difference]: With dead ends: 50889 [2019-12-07 18:11:28,443 INFO L226 Difference]: Without dead ends: 50863 [2019-12-07 18:11:28,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:11:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50863 states. [2019-12-07 18:11:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50863 to 42927. [2019-12-07 18:11:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42927 states. [2019-12-07 18:11:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42927 states to 42927 states and 136375 transitions. [2019-12-07 18:11:29,276 INFO L78 Accepts]: Start accepts. Automaton has 42927 states and 136375 transitions. Word has length 25 [2019-12-07 18:11:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:29,276 INFO L462 AbstractCegarLoop]: Abstraction has 42927 states and 136375 transitions. [2019-12-07 18:11:29,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:11:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 42927 states and 136375 transitions. [2019-12-07 18:11:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:11:29,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:29,287 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] [2019-12-07 18:11:29,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-07 18:11:29,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:29,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193077885] [2019-12-07 18:11:29,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:29,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193077885] [2019-12-07 18:11:29,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:29,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:11:29,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717983559] [2019-12-07 18:11:29,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:11:29,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:11:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:11:29,330 INFO L87 Difference]: Start difference. First operand 42927 states and 136375 transitions. Second operand 6 states. [2019-12-07 18:11:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:29,768 INFO L93 Difference]: Finished difference Result 62081 states and 192662 transitions. [2019-12-07 18:11:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:11:29,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 18:11:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:29,851 INFO L225 Difference]: With dead ends: 62081 [2019-12-07 18:11:29,851 INFO L226 Difference]: Without dead ends: 62005 [2019-12-07 18:11:29,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:11:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62005 states. [2019-12-07 18:11:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62005 to 46294. [2019-12-07 18:11:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46294 states. [2019-12-07 18:11:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46294 states to 46294 states and 146464 transitions. [2019-12-07 18:11:30,649 INFO L78 Accepts]: Start accepts. Automaton has 46294 states and 146464 transitions. Word has length 27 [2019-12-07 18:11:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:30,649 INFO L462 AbstractCegarLoop]: Abstraction has 46294 states and 146464 transitions. [2019-12-07 18:11:30,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:11:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 46294 states and 146464 transitions. [2019-12-07 18:11:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:11:30,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:30,662 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] [2019-12-07 18:11:30,662 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1906099876, now seen corresponding path program 1 times [2019-12-07 18:11:30,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:30,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779642908] [2019-12-07 18:11:30,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:30,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779642908] [2019-12-07 18:11:30,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:30,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:11:30,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394945145] [2019-12-07 18:11:30,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:11:30,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:11:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:30,711 INFO L87 Difference]: Start difference. First operand 46294 states and 146464 transitions. Second operand 3 states. [2019-12-07 18:11:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:30,918 INFO L93 Difference]: Finished difference Result 83360 states and 263407 transitions. [2019-12-07 18:11:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:11:30,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 18:11:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:31,023 INFO L225 Difference]: With dead ends: 83360 [2019-12-07 18:11:31,023 INFO L226 Difference]: Without dead ends: 73842 [2019-12-07 18:11:31,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73842 states. [2019-12-07 18:11:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73842 to 72499. [2019-12-07 18:11:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72499 states. [2019-12-07 18:11:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72499 states to 72499 states and 229312 transitions. [2019-12-07 18:11:32,152 INFO L78 Accepts]: Start accepts. Automaton has 72499 states and 229312 transitions. Word has length 29 [2019-12-07 18:11:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:32,152 INFO L462 AbstractCegarLoop]: Abstraction has 72499 states and 229312 transitions. [2019-12-07 18:11:32,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:11:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 72499 states and 229312 transitions. [2019-12-07 18:11:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:11:32,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:32,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:32,179 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash 489045679, now seen corresponding path program 1 times [2019-12-07 18:11:32,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:32,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156848660] [2019-12-07 18:11:32,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:32,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156848660] [2019-12-07 18:11:32,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:32,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:11:32,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993269908] [2019-12-07 18:11:32,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:11:32,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:11:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:11:32,208 INFO L87 Difference]: Start difference. First operand 72499 states and 229312 transitions. Second operand 4 states. [2019-12-07 18:11:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:32,289 INFO L93 Difference]: Finished difference Result 27672 states and 83740 transitions. [2019-12-07 18:11:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:11:32,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 18:11:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:32,322 INFO L225 Difference]: With dead ends: 27672 [2019-12-07 18:11:32,322 INFO L226 Difference]: Without dead ends: 27672 [2019-12-07 18:11:32,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:11:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27672 states. [2019-12-07 18:11:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27672 to 25895. [2019-12-07 18:11:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25895 states. [2019-12-07 18:11:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25895 states to 25895 states and 78383 transitions. [2019-12-07 18:11:32,678 INFO L78 Accepts]: Start accepts. Automaton has 25895 states and 78383 transitions. Word has length 30 [2019-12-07 18:11:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:32,678 INFO L462 AbstractCegarLoop]: Abstraction has 25895 states and 78383 transitions. [2019-12-07 18:11:32,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:11:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25895 states and 78383 transitions. [2019-12-07 18:11:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:11:32,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:32,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:32,698 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:32,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-07 18:11:32,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:32,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717247774] [2019-12-07 18:11:32,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:32,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717247774] [2019-12-07 18:11:32,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:32,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:11:32,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604554203] [2019-12-07 18:11:32,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:11:32,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:32,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:11:32,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:11:32,749 INFO L87 Difference]: Start difference. First operand 25895 states and 78383 transitions. Second operand 7 states. [2019-12-07 18:11:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:33,495 INFO L93 Difference]: Finished difference Result 34114 states and 100420 transitions. [2019-12-07 18:11:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:11:33,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 18:11:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:33,532 INFO L225 Difference]: With dead ends: 34114 [2019-12-07 18:11:33,532 INFO L226 Difference]: Without dead ends: 34114 [2019-12-07 18:11:33,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:11:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34114 states. [2019-12-07 18:11:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34114 to 26244. [2019-12-07 18:11:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26244 states. [2019-12-07 18:11:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26244 states to 26244 states and 79118 transitions. [2019-12-07 18:11:33,953 INFO L78 Accepts]: Start accepts. Automaton has 26244 states and 79118 transitions. Word has length 33 [2019-12-07 18:11:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:33,953 INFO L462 AbstractCegarLoop]: Abstraction has 26244 states and 79118 transitions. [2019-12-07 18:11:33,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:11:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 26244 states and 79118 transitions. [2019-12-07 18:11:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:11:33,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:33,973 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] [2019-12-07 18:11:33,973 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:33,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash 604372690, now seen corresponding path program 1 times [2019-12-07 18:11:33,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:33,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948114939] [2019-12-07 18:11:33,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:34,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948114939] [2019-12-07 18:11:34,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:34,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:11:34,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577177647] [2019-12-07 18:11:34,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:11:34,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:34,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:11:34,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:34,017 INFO L87 Difference]: Start difference. First operand 26244 states and 79118 transitions. Second operand 3 states. [2019-12-07 18:11:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:34,100 INFO L93 Difference]: Finished difference Result 26244 states and 78236 transitions. [2019-12-07 18:11:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:11:34,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 18:11:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:34,134 INFO L225 Difference]: With dead ends: 26244 [2019-12-07 18:11:34,134 INFO L226 Difference]: Without dead ends: 26244 [2019-12-07 18:11:34,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26244 states. [2019-12-07 18:11:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26244 to 25854. [2019-12-07 18:11:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25854 states. [2019-12-07 18:11:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25854 states to 25854 states and 77156 transitions. [2019-12-07 18:11:34,513 INFO L78 Accepts]: Start accepts. Automaton has 25854 states and 77156 transitions. Word has length 40 [2019-12-07 18:11:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:34,513 INFO L462 AbstractCegarLoop]: Abstraction has 25854 states and 77156 transitions. [2019-12-07 18:11:34,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:11:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25854 states and 77156 transitions. [2019-12-07 18:11:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:11:34,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:34,533 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 18:11:34,533 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1437156552, now seen corresponding path program 1 times [2019-12-07 18:11:34,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:34,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492742011] [2019-12-07 18:11:34,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:34,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492742011] [2019-12-07 18:11:34,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:34,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:11:34,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617342801] [2019-12-07 18:11:34,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:11:34,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:34,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:11:34,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:11:34,651 INFO L87 Difference]: Start difference. First operand 25854 states and 77156 transitions. Second operand 9 states. [2019-12-07 18:11:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:34,992 INFO L93 Difference]: Finished difference Result 26986 states and 80539 transitions. [2019-12-07 18:11:34,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:11:34,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-07 18:11:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:35,021 INFO L225 Difference]: With dead ends: 26986 [2019-12-07 18:11:35,021 INFO L226 Difference]: Without dead ends: 26986 [2019-12-07 18:11:35,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:11:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26986 states. [2019-12-07 18:11:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26986 to 25410. [2019-12-07 18:11:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25410 states. [2019-12-07 18:11:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25410 states to 25410 states and 75872 transitions. [2019-12-07 18:11:35,386 INFO L78 Accepts]: Start accepts. Automaton has 25410 states and 75872 transitions. Word has length 41 [2019-12-07 18:11:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:35,386 INFO L462 AbstractCegarLoop]: Abstraction has 25410 states and 75872 transitions. [2019-12-07 18:11:35,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:11:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 25410 states and 75872 transitions. [2019-12-07 18:11:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:11:35,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:35,407 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 18:11:35,407 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash 271932427, now seen corresponding path program 1 times [2019-12-07 18:11:35,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:35,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137228071] [2019-12-07 18:11:35,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:35,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137228071] [2019-12-07 18:11:35,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:35,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:11:35,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194669595] [2019-12-07 18:11:35,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:11:35,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:11:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:11:35,446 INFO L87 Difference]: Start difference. First operand 25410 states and 75872 transitions. Second operand 4 states. [2019-12-07 18:11:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:35,559 INFO L93 Difference]: Finished difference Result 44127 states and 132445 transitions. [2019-12-07 18:11:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:11:35,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 18:11:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:35,587 INFO L225 Difference]: With dead ends: 44127 [2019-12-07 18:11:35,587 INFO L226 Difference]: Without dead ends: 24084 [2019-12-07 18:11:35,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24084 states. [2019-12-07 18:11:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24084 to 24080. [2019-12-07 18:11:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24080 states. [2019-12-07 18:11:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24080 states to 24080 states and 71137 transitions. [2019-12-07 18:11:35,897 INFO L78 Accepts]: Start accepts. Automaton has 24080 states and 71137 transitions. Word has length 42 [2019-12-07 18:11:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:35,897 INFO L462 AbstractCegarLoop]: Abstraction has 24080 states and 71137 transitions. [2019-12-07 18:11:35,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:11:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 24080 states and 71137 transitions. [2019-12-07 18:11:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:11:35,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:35,916 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 18:11:35,916 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash 180152339, now seen corresponding path program 2 times [2019-12-07 18:11:35,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:35,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307513224] [2019-12-07 18:11:35,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:35,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307513224] [2019-12-07 18:11:35,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:35,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:11:35,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729381584] [2019-12-07 18:11:35,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:11:35,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:11:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:35,964 INFO L87 Difference]: Start difference. First operand 24080 states and 71137 transitions. Second operand 5 states. [2019-12-07 18:11:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:36,030 INFO L93 Difference]: Finished difference Result 22021 states and 66605 transitions. [2019-12-07 18:11:36,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:11:36,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 18:11:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:36,053 INFO L225 Difference]: With dead ends: 22021 [2019-12-07 18:11:36,053 INFO L226 Difference]: Without dead ends: 21002 [2019-12-07 18:11:36,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21002 states. [2019-12-07 18:11:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21002 to 12315. [2019-12-07 18:11:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12315 states. [2019-12-07 18:11:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12315 states to 12315 states and 37594 transitions. [2019-12-07 18:11:36,268 INFO L78 Accepts]: Start accepts. Automaton has 12315 states and 37594 transitions. Word has length 42 [2019-12-07 18:11:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:36,268 INFO L462 AbstractCegarLoop]: Abstraction has 12315 states and 37594 transitions. [2019-12-07 18:11:36,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:11:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 12315 states and 37594 transitions. [2019-12-07 18:11:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:11:36,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:36,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:36,278 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1679133281, now seen corresponding path program 1 times [2019-12-07 18:11:36,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:36,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290616031] [2019-12-07 18:11:36,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:36,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290616031] [2019-12-07 18:11:36,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:36,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:11:36,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557773908] [2019-12-07 18:11:36,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:11:36,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:11:36,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:36,310 INFO L87 Difference]: Start difference. First operand 12315 states and 37594 transitions. Second operand 3 states. [2019-12-07 18:11:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:36,372 INFO L93 Difference]: Finished difference Result 17435 states and 53568 transitions. [2019-12-07 18:11:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:11:36,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:11:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:36,392 INFO L225 Difference]: With dead ends: 17435 [2019-12-07 18:11:36,392 INFO L226 Difference]: Without dead ends: 17435 [2019-12-07 18:11:36,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-12-07 18:11:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 13825. [2019-12-07 18:11:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-12-07 18:11:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 42890 transitions. [2019-12-07 18:11:36,600 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 42890 transitions. Word has length 66 [2019-12-07 18:11:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:36,600 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 42890 transitions. [2019-12-07 18:11:36,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:11:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 42890 transitions. [2019-12-07 18:11:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:11:36,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:36,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:36,612 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-07 18:11:36,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:36,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426265511] [2019-12-07 18:11:36,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:36,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426265511] [2019-12-07 18:11:36,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:36,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:11:36,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121061782] [2019-12-07 18:11:36,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:11:36,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:11:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:36,649 INFO L87 Difference]: Start difference. First operand 13825 states and 42890 transitions. Second operand 3 states. [2019-12-07 18:11:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:36,723 INFO L93 Difference]: Finished difference Result 16559 states and 51096 transitions. [2019-12-07 18:11:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:11:36,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:11:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:36,741 INFO L225 Difference]: With dead ends: 16559 [2019-12-07 18:11:36,741 INFO L226 Difference]: Without dead ends: 16559 [2019-12-07 18:11:36,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:11:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16559 states. [2019-12-07 18:11:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16559 to 14159. [2019-12-07 18:11:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14159 states. [2019-12-07 18:11:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14159 states to 14159 states and 43984 transitions. [2019-12-07 18:11:36,954 INFO L78 Accepts]: Start accepts. Automaton has 14159 states and 43984 transitions. Word has length 66 [2019-12-07 18:11:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:36,954 INFO L462 AbstractCegarLoop]: Abstraction has 14159 states and 43984 transitions. [2019-12-07 18:11:36,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:11:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14159 states and 43984 transitions. [2019-12-07 18:11:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:11:36,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:36,966 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:36,966 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1083729260, now seen corresponding path program 1 times [2019-12-07 18:11:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:36,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494917328] [2019-12-07 18:11:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:37,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494917328] [2019-12-07 18:11:37,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:37,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:11:37,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797924955] [2019-12-07 18:11:37,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:11:37,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:11:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:11:37,003 INFO L87 Difference]: Start difference. First operand 14159 states and 43984 transitions. Second operand 4 states. [2019-12-07 18:11:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:37,217 INFO L93 Difference]: Finished difference Result 23560 states and 73744 transitions. [2019-12-07 18:11:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:11:37,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:11:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:37,244 INFO L225 Difference]: With dead ends: 23560 [2019-12-07 18:11:37,244 INFO L226 Difference]: Without dead ends: 23560 [2019-12-07 18:11:37,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-12-07 18:11:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 15375. [2019-12-07 18:11:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15375 states. [2019-12-07 18:11:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15375 states to 15375 states and 48287 transitions. [2019-12-07 18:11:37,514 INFO L78 Accepts]: Start accepts. Automaton has 15375 states and 48287 transitions. Word has length 67 [2019-12-07 18:11:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:37,514 INFO L462 AbstractCegarLoop]: Abstraction has 15375 states and 48287 transitions. [2019-12-07 18:11:37,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:11:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 15375 states and 48287 transitions. [2019-12-07 18:11:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:11:37,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:37,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:37,527 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:37,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:37,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1833873751, now seen corresponding path program 1 times [2019-12-07 18:11:37,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:37,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194509526] [2019-12-07 18:11:37,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194509526] [2019-12-07 18:11:37,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:37,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:11:37,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858432141] [2019-12-07 18:11:37,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:11:37,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:11:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:11:37,571 INFO L87 Difference]: Start difference. First operand 15375 states and 48287 transitions. Second operand 4 states. [2019-12-07 18:11:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:37,650 INFO L93 Difference]: Finished difference Result 15375 states and 48131 transitions. [2019-12-07 18:11:37,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:11:37,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:11:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:37,668 INFO L225 Difference]: With dead ends: 15375 [2019-12-07 18:11:37,668 INFO L226 Difference]: Without dead ends: 15375 [2019-12-07 18:11:37,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:11:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15375 states. [2019-12-07 18:11:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15375 to 12967. [2019-12-07 18:11:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12967 states. [2019-12-07 18:11:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12967 states to 12967 states and 40150 transitions. [2019-12-07 18:11:37,869 INFO L78 Accepts]: Start accepts. Automaton has 12967 states and 40150 transitions. Word has length 67 [2019-12-07 18:11:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:37,869 INFO L462 AbstractCegarLoop]: Abstraction has 12967 states and 40150 transitions. [2019-12-07 18:11:37,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:11:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 12967 states and 40150 transitions. [2019-12-07 18:11:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:11:37,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:37,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:37,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-07 18:11:37,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:37,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327617958] [2019-12-07 18:11:37,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:38,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327617958] [2019-12-07 18:11:38,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:38,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:11:38,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391657376] [2019-12-07 18:11:38,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:11:38,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:11:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:11:38,041 INFO L87 Difference]: Start difference. First operand 12967 states and 40150 transitions. Second operand 11 states. [2019-12-07 18:11:38,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:38,858 INFO L93 Difference]: Finished difference Result 39606 states and 122225 transitions. [2019-12-07 18:11:38,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 18:11:38,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 18:11:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:38,890 INFO L225 Difference]: With dead ends: 39606 [2019-12-07 18:11:38,890 INFO L226 Difference]: Without dead ends: 26232 [2019-12-07 18:11:38,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:11:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2019-12-07 18:11:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 15360. [2019-12-07 18:11:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15360 states. [2019-12-07 18:11:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15360 states to 15360 states and 47226 transitions. [2019-12-07 18:11:39,163 INFO L78 Accepts]: Start accepts. Automaton has 15360 states and 47226 transitions. Word has length 67 [2019-12-07 18:11:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:39,163 INFO L462 AbstractCegarLoop]: Abstraction has 15360 states and 47226 transitions. [2019-12-07 18:11:39,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:11:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 15360 states and 47226 transitions. [2019-12-07 18:11:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:11:39,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:39,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:39,175 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 2 times [2019-12-07 18:11:39,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:39,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96276278] [2019-12-07 18:11:39,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:39,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96276278] [2019-12-07 18:11:39,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:39,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:11:39,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851855158] [2019-12-07 18:11:39,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:11:39,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:11:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:11:39,320 INFO L87 Difference]: Start difference. First operand 15360 states and 47226 transitions. Second operand 12 states. [2019-12-07 18:11:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:39,902 INFO L93 Difference]: Finished difference Result 26787 states and 81319 transitions. [2019-12-07 18:11:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:11:39,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 18:11:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:39,932 INFO L225 Difference]: With dead ends: 26787 [2019-12-07 18:11:39,932 INFO L226 Difference]: Without dead ends: 25856 [2019-12-07 18:11:39,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:11:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25856 states. [2019-12-07 18:11:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25856 to 15112. [2019-12-07 18:11:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15112 states. [2019-12-07 18:11:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 46482 transitions. [2019-12-07 18:11:40,201 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 46482 transitions. Word has length 67 [2019-12-07 18:11:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:40,201 INFO L462 AbstractCegarLoop]: Abstraction has 15112 states and 46482 transitions. [2019-12-07 18:11:40,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:11:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 46482 transitions. [2019-12-07 18:11:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:11:40,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:40,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:40,214 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1650094651, now seen corresponding path program 3 times [2019-12-07 18:11:40,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:40,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483677840] [2019-12-07 18:11:40,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:11:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:11:40,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483677840] [2019-12-07 18:11:40,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:11:40,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:11:40,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903606303] [2019-12-07 18:11:40,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:11:40,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:11:40,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:11:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:11:40,272 INFO L87 Difference]: Start difference. First operand 15112 states and 46482 transitions. Second operand 6 states. [2019-12-07 18:11:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:11:40,602 INFO L93 Difference]: Finished difference Result 40857 states and 123653 transitions. [2019-12-07 18:11:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:11:40,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-07 18:11:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:11:40,654 INFO L225 Difference]: With dead ends: 40857 [2019-12-07 18:11:40,655 INFO L226 Difference]: Without dead ends: 37689 [2019-12-07 18:11:40,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:11:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37689 states. [2019-12-07 18:11:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37689 to 15234. [2019-12-07 18:11:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15234 states. [2019-12-07 18:11:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15234 states to 15234 states and 46741 transitions. [2019-12-07 18:11:41,021 INFO L78 Accepts]: Start accepts. Automaton has 15234 states and 46741 transitions. Word has length 67 [2019-12-07 18:11:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:11:41,021 INFO L462 AbstractCegarLoop]: Abstraction has 15234 states and 46741 transitions. [2019-12-07 18:11:41,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:11:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 15234 states and 46741 transitions. [2019-12-07 18:11:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:11:41,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:11:41,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:11:41,034 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:11:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:11:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 4 times [2019-12-07 18:11:41,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:11:41,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725719192] [2019-12-07 18:11:41,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:11:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:11:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:11:41,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:11:41,103 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:11:41,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26| 1) |v_#valid_69|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t2296~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26|) 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2296~0.base_26| 4)) (= v_~z$r_buff1_thd0~0_133 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26|) |v_ULTIMATE.start_main_~#t2296~0.offset_19| 0))) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2296~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_12|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2296~0.base=|v_ULTIMATE.start_main_~#t2296~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2296~0.offset=|v_ULTIMATE.start_main_~#t2296~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2297~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2298~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2298~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t2296~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2297~0.offset, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2296~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:11:41,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2297~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2297~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9|) |v_ULTIMATE.start_main_~#t2297~0.offset_8| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2297~0.offset_8|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9| 1) |v_#valid_33|) (not (= 0 |v_ULTIMATE.start_main_~#t2297~0.base_9|)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2297~0.base, #length, ULTIMATE.start_main_~#t2297~0.offset] because there is no mapped edge [2019-12-07 18:11:41,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.offset_In1500663182| P0Thread1of1ForFork0_~arg.offset_Out1500663182) (= 1 ~z$w_buff0_used~0_Out1500663182) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1500663182| (ite (not (and (not (= (mod ~z$w_buff0_used~0_Out1500663182 256) 0)) (not (= (mod ~z$w_buff1_used~0_Out1500663182 256) 0)))) 1 0)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1500663182| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1500663182) (= 1 ~z$w_buff0~0_Out1500663182) (= P0Thread1of1ForFork0_~arg.base_Out1500663182 |P0Thread1of1ForFork0_#in~arg.base_In1500663182|) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1500663182 0)) (= ~z$w_buff1_used~0_Out1500663182 ~z$w_buff0_used~0_In1500663182) (= ~z$w_buff1~0_Out1500663182 ~z$w_buff0~0_In1500663182)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1500663182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1500663182, ~z$w_buff0~0=~z$w_buff0~0_In1500663182, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1500663182|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1500663182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1500663182, ~z$w_buff0~0=~z$w_buff0~0_Out1500663182, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1500663182, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1500663182, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1500663182|, ~z$w_buff1~0=~z$w_buff1~0_Out1500663182, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1500663182, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1500663182|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1500663182} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 18:11:41,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2298~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2298~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2298~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11|) |v_ULTIMATE.start_main_~#t2298~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2298~0.base_11|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11| 1) |v_#valid_40|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2298~0.offset, #length, ULTIMATE.start_main_~#t2298~0.base] because there is no mapped edge [2019-12-07 18:11:41,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1588138099 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1588138099 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1588138099| |P1Thread1of1ForFork1_#t~ite9_Out1588138099|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1588138099| ~z$w_buff1~0_In1588138099) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~z~0_In1588138099 |P1Thread1of1ForFork1_#t~ite9_Out1588138099|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1588138099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1588138099, ~z$w_buff1~0=~z$w_buff1~0_In1588138099, ~z~0=~z~0_In1588138099} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1588138099|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1588138099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1588138099, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1588138099|, ~z$w_buff1~0=~z$w_buff1~0_In1588138099, ~z~0=~z~0_In1588138099} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 18:11:41,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-528749041 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-528749041 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-528749041| ~z$w_buff0_used~0_In-528749041) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-528749041| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-528749041, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-528749041} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-528749041, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-528749041|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-528749041} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 18:11:41,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-161011124 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-161011124 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-161011124 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-161011124 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-161011124| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-161011124 |P1Thread1of1ForFork1_#t~ite12_Out-161011124|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-161011124, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-161011124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-161011124, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-161011124} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-161011124, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-161011124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-161011124, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-161011124|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-161011124} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 18:11:41,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1190157197 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1190157197 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1190157197 |P1Thread1of1ForFork1_#t~ite13_Out-1190157197|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1190157197|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1190157197, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1190157197} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1190157197, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1190157197|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1190157197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 18:11:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In797084839 256) 0))) (or (and (= ~z$w_buff1~0_In797084839 |P2Thread1of1ForFork2_#t~ite23_Out797084839|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In797084839 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In797084839 256) 0)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In797084839 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In797084839 256)))) (= |P2Thread1of1ForFork2_#t~ite24_Out797084839| |P2Thread1of1ForFork2_#t~ite23_Out797084839|) .cse1) (and (= ~z$w_buff1~0_In797084839 |P2Thread1of1ForFork2_#t~ite24_Out797084839|) (= |P2Thread1of1ForFork2_#t~ite23_In797084839| |P2Thread1of1ForFork2_#t~ite23_Out797084839|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In797084839|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In797084839, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In797084839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In797084839, ~z$w_buff1~0=~z$w_buff1~0_In797084839, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In797084839, ~weak$$choice2~0=~weak$$choice2~0_In797084839} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out797084839|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out797084839|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In797084839, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In797084839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In797084839, ~z$w_buff1~0=~z$w_buff1~0_In797084839, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In797084839, ~weak$$choice2~0=~weak$$choice2~0_In797084839} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 18:11:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-782315782 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out-782315782| ~z$w_buff0_used~0_In-782315782) .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out-782315782| |P2Thread1of1ForFork2_#t~ite27_Out-782315782|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-782315782 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-782315782 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-782315782 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-782315782 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork2_#t~ite26_In-782315782| |P2Thread1of1ForFork2_#t~ite26_Out-782315782|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out-782315782| ~z$w_buff0_used~0_In-782315782)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-782315782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-782315782, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-782315782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-782315782, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-782315782, ~weak$$choice2~0=~weak$$choice2~0_In-782315782} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-782315782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-782315782, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-782315782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-782315782, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-782315782, ~weak$$choice2~0=~weak$$choice2~0_In-782315782, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-782315782|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 18:11:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1431624533 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1431624533 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1431624533 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1431624533 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1431624533 |P1Thread1of1ForFork1_#t~ite14_Out-1431624533|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1431624533| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431624533, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1431624533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431624533, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1431624533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431624533, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1431624533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431624533, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1431624533|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1431624533} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:11:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:11:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1538135642 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out1538135642| ~z$w_buff1_used~0_In1538135642) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1538135642 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1538135642 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1538135642 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1538135642 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out1538135642| |P2Thread1of1ForFork2_#t~ite30_Out1538135642|)) (and (not .cse0) (= ~z$w_buff1_used~0_In1538135642 |P2Thread1of1ForFork2_#t~ite30_Out1538135642|) (= |P2Thread1of1ForFork2_#t~ite29_In1538135642| |P2Thread1of1ForFork2_#t~ite29_Out1538135642|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1538135642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1538135642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1538135642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1538135642, ~weak$$choice2~0=~weak$$choice2~0_In1538135642, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1538135642|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1538135642|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1538135642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1538135642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1538135642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1538135642, ~weak$$choice2~0=~weak$$choice2~0_In1538135642, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1538135642|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 18:11:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 18:11:41,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:11:41,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-378631472 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-378631472 256) 0))) (or (and (= ~z$w_buff0_used~0_In-378631472 |P0Thread1of1ForFork0_#t~ite5_Out-378631472|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-378631472|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-378631472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-378631472} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-378631472|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-378631472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-378631472} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:11:41,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-535919447 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-535919447 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-535919447 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-535919447 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-535919447| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-535919447 |P0Thread1of1ForFork0_#t~ite6_Out-535919447|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-535919447, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-535919447, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-535919447, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-535919447} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-535919447|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-535919447, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-535919447, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-535919447, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-535919447} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:11:41,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out622205512 ~z$r_buff0_thd1~0_In622205512)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In622205512 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In622205512 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~z$r_buff0_thd1~0_Out622205512 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In622205512, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In622205512} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In622205512, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out622205512|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out622205512} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:11:41,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-2126276268 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2126276268 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-2126276268 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2126276268 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2126276268| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-2126276268| ~z$r_buff1_thd1~0_In-2126276268)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126276268, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2126276268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126276268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2126276268} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126276268, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2126276268|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2126276268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126276268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2126276268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:11:41,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:11:41,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1413035775 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1413035775 256) 0)) (.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out-1413035775| |P2Thread1of1ForFork2_#t~ite38_Out-1413035775|))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out-1413035775| ~z$w_buff1~0_In-1413035775) (not .cse2)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1413035775| ~z~0_In-1413035775) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1413035775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413035775, ~z$w_buff1~0=~z$w_buff1~0_In-1413035775, ~z~0=~z~0_In-1413035775} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1413035775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413035775, ~z$w_buff1~0=~z$w_buff1~0_In-1413035775, ~z~0=~z~0_In-1413035775, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1413035775|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1413035775|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 18:11:41,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1126719429 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1126719429 256)))) (or (and (= ~z$w_buff0_used~0_In1126719429 |P2Thread1of1ForFork2_#t~ite40_Out1126719429|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1126719429|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1126719429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1126719429} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1126719429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1126719429, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1126719429|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 18:11:41,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-352829324 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-352829324 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-352829324 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-352829324 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-352829324|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-352829324 |P2Thread1of1ForFork2_#t~ite41_Out-352829324|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-352829324, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-352829324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-352829324, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-352829324} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-352829324|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-352829324, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-352829324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-352829324, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-352829324} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 18:11:41,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-660104721 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-660104721 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-660104721| ~z$r_buff0_thd3~0_In-660104721) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-660104721|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-660104721, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-660104721} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-660104721|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-660104721, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-660104721} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 18:11:41,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-118094761 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-118094761 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-118094761 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-118094761 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-118094761|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-118094761 |P2Thread1of1ForFork2_#t~ite43_Out-118094761|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-118094761, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-118094761, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-118094761, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-118094761} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-118094761, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-118094761, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-118094761|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-118094761, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-118094761} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 18:11:41,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 18:11:41,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:11:41,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1128090314| |ULTIMATE.start_main_#t~ite47_Out-1128090314|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1128090314 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1128090314 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1128090314 |ULTIMATE.start_main_#t~ite47_Out-1128090314|)) (and .cse0 (not .cse2) (= ~z$w_buff1~0_In-1128090314 |ULTIMATE.start_main_#t~ite47_Out-1128090314|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128090314, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128090314, ~z$w_buff1~0=~z$w_buff1~0_In-1128090314, ~z~0=~z~0_In-1128090314} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128090314, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1128090314|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128090314, ~z$w_buff1~0=~z$w_buff1~0_In-1128090314, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1128090314|, ~z~0=~z~0_In-1128090314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 18:11:41,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-137214086 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-137214086 256) 0))) (or (and (= ~z$w_buff0_used~0_In-137214086 |ULTIMATE.start_main_#t~ite49_Out-137214086|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-137214086|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137214086, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137214086} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137214086, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137214086, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-137214086|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 18:11:41,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-819092378 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-819092378 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-819092378 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-819092378 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-819092378| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-819092378| ~z$w_buff1_used~0_In-819092378)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819092378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819092378, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-819092378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-819092378} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-819092378|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819092378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819092378, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-819092378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-819092378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 18:11:41,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In752503061 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In752503061 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In752503061 |ULTIMATE.start_main_#t~ite51_Out752503061|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out752503061| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In752503061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In752503061} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In752503061, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out752503061|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In752503061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 18:11:41,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In360029157 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In360029157 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In360029157 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In360029157 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out360029157|)) (and (= ~z$r_buff1_thd0~0_In360029157 |ULTIMATE.start_main_#t~ite52_Out360029157|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In360029157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In360029157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In360029157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In360029157} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out360029157|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In360029157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In360029157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In360029157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In360029157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 18:11:41,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~x~0_49 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:11:41,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:11:41 BasicIcfg [2019-12-07 18:11:41,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:11:41,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:11:41,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:11:41,173 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:11:41,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:10:19" (3/4) ... [2019-12-07 18:11:41,175 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:11:41,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26| 1) |v_#valid_69|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t2296~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26|) 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2296~0.base_26| 4)) (= v_~z$r_buff1_thd0~0_133 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26|) |v_ULTIMATE.start_main_~#t2296~0.offset_19| 0))) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2296~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_12|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2296~0.base=|v_ULTIMATE.start_main_~#t2296~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2296~0.offset=|v_ULTIMATE.start_main_~#t2296~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2297~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2298~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2298~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t2296~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2297~0.offset, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2296~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:11:41,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2297~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2297~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9|) |v_ULTIMATE.start_main_~#t2297~0.offset_8| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2297~0.offset_8|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9| 1) |v_#valid_33|) (not (= 0 |v_ULTIMATE.start_main_~#t2297~0.base_9|)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2297~0.base, #length, ULTIMATE.start_main_~#t2297~0.offset] because there is no mapped edge [2019-12-07 18:11:41,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.offset_In1500663182| P0Thread1of1ForFork0_~arg.offset_Out1500663182) (= 1 ~z$w_buff0_used~0_Out1500663182) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1500663182| (ite (not (and (not (= (mod ~z$w_buff0_used~0_Out1500663182 256) 0)) (not (= (mod ~z$w_buff1_used~0_Out1500663182 256) 0)))) 1 0)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1500663182| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1500663182) (= 1 ~z$w_buff0~0_Out1500663182) (= P0Thread1of1ForFork0_~arg.base_Out1500663182 |P0Thread1of1ForFork0_#in~arg.base_In1500663182|) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1500663182 0)) (= ~z$w_buff1_used~0_Out1500663182 ~z$w_buff0_used~0_In1500663182) (= ~z$w_buff1~0_Out1500663182 ~z$w_buff0~0_In1500663182)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1500663182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1500663182, ~z$w_buff0~0=~z$w_buff0~0_In1500663182, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1500663182|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1500663182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1500663182, ~z$w_buff0~0=~z$w_buff0~0_Out1500663182, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1500663182, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1500663182, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1500663182|, ~z$w_buff1~0=~z$w_buff1~0_Out1500663182, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1500663182, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1500663182|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1500663182} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 18:11:41,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2298~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2298~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2298~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11|) |v_ULTIMATE.start_main_~#t2298~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2298~0.base_11|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11| 1) |v_#valid_40|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2298~0.offset, #length, ULTIMATE.start_main_~#t2298~0.base] because there is no mapped edge [2019-12-07 18:11:41,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1588138099 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1588138099 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1588138099| |P1Thread1of1ForFork1_#t~ite9_Out1588138099|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1588138099| ~z$w_buff1~0_In1588138099) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~z~0_In1588138099 |P1Thread1of1ForFork1_#t~ite9_Out1588138099|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1588138099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1588138099, ~z$w_buff1~0=~z$w_buff1~0_In1588138099, ~z~0=~z~0_In1588138099} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1588138099|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1588138099, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1588138099, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1588138099|, ~z$w_buff1~0=~z$w_buff1~0_In1588138099, ~z~0=~z~0_In1588138099} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 18:11:41,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-528749041 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-528749041 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-528749041| ~z$w_buff0_used~0_In-528749041) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-528749041| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-528749041, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-528749041} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-528749041, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-528749041|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-528749041} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 18:11:41,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-161011124 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-161011124 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-161011124 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-161011124 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-161011124| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-161011124 |P1Thread1of1ForFork1_#t~ite12_Out-161011124|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-161011124, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-161011124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-161011124, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-161011124} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-161011124, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-161011124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-161011124, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-161011124|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-161011124} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 18:11:41,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1190157197 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1190157197 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1190157197 |P1Thread1of1ForFork1_#t~ite13_Out-1190157197|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1190157197|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1190157197, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1190157197} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1190157197, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1190157197|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1190157197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 18:11:41,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In797084839 256) 0))) (or (and (= ~z$w_buff1~0_In797084839 |P2Thread1of1ForFork2_#t~ite23_Out797084839|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In797084839 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In797084839 256) 0)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In797084839 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In797084839 256)))) (= |P2Thread1of1ForFork2_#t~ite24_Out797084839| |P2Thread1of1ForFork2_#t~ite23_Out797084839|) .cse1) (and (= ~z$w_buff1~0_In797084839 |P2Thread1of1ForFork2_#t~ite24_Out797084839|) (= |P2Thread1of1ForFork2_#t~ite23_In797084839| |P2Thread1of1ForFork2_#t~ite23_Out797084839|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In797084839|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In797084839, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In797084839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In797084839, ~z$w_buff1~0=~z$w_buff1~0_In797084839, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In797084839, ~weak$$choice2~0=~weak$$choice2~0_In797084839} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out797084839|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out797084839|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In797084839, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In797084839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In797084839, ~z$w_buff1~0=~z$w_buff1~0_In797084839, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In797084839, ~weak$$choice2~0=~weak$$choice2~0_In797084839} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 18:11:41,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-782315782 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out-782315782| ~z$w_buff0_used~0_In-782315782) .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out-782315782| |P2Thread1of1ForFork2_#t~ite27_Out-782315782|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-782315782 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-782315782 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-782315782 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-782315782 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork2_#t~ite26_In-782315782| |P2Thread1of1ForFork2_#t~ite26_Out-782315782|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out-782315782| ~z$w_buff0_used~0_In-782315782)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-782315782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-782315782, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-782315782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-782315782, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-782315782, ~weak$$choice2~0=~weak$$choice2~0_In-782315782} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-782315782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-782315782, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-782315782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-782315782, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-782315782, ~weak$$choice2~0=~weak$$choice2~0_In-782315782, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-782315782|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 18:11:41,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1431624533 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1431624533 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1431624533 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1431624533 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1431624533 |P1Thread1of1ForFork1_#t~ite14_Out-1431624533|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1431624533| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431624533, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1431624533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431624533, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1431624533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431624533, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1431624533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431624533, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1431624533|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1431624533} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:11:41,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:11:41,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1538135642 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out1538135642| ~z$w_buff1_used~0_In1538135642) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1538135642 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1538135642 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1538135642 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1538135642 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out1538135642| |P2Thread1of1ForFork2_#t~ite30_Out1538135642|)) (and (not .cse0) (= ~z$w_buff1_used~0_In1538135642 |P2Thread1of1ForFork2_#t~ite30_Out1538135642|) (= |P2Thread1of1ForFork2_#t~ite29_In1538135642| |P2Thread1of1ForFork2_#t~ite29_Out1538135642|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1538135642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1538135642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1538135642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1538135642, ~weak$$choice2~0=~weak$$choice2~0_In1538135642, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1538135642|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1538135642|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1538135642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1538135642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1538135642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1538135642, ~weak$$choice2~0=~weak$$choice2~0_In1538135642, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1538135642|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 18:11:41,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 18:11:41,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:11:41,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-378631472 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-378631472 256) 0))) (or (and (= ~z$w_buff0_used~0_In-378631472 |P0Thread1of1ForFork0_#t~ite5_Out-378631472|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-378631472|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-378631472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-378631472} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-378631472|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-378631472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-378631472} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:11:41,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-535919447 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-535919447 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-535919447 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-535919447 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-535919447| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-535919447 |P0Thread1of1ForFork0_#t~ite6_Out-535919447|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-535919447, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-535919447, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-535919447, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-535919447} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-535919447|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-535919447, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-535919447, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-535919447, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-535919447} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:11:41,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out622205512 ~z$r_buff0_thd1~0_In622205512)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In622205512 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In622205512 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~z$r_buff0_thd1~0_Out622205512 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In622205512, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In622205512} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In622205512, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out622205512|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out622205512} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:11:41,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-2126276268 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2126276268 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-2126276268 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2126276268 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2126276268| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-2126276268| ~z$r_buff1_thd1~0_In-2126276268)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126276268, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2126276268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126276268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2126276268} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126276268, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2126276268|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2126276268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126276268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2126276268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:11:41,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:11:41,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1413035775 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1413035775 256) 0)) (.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out-1413035775| |P2Thread1of1ForFork2_#t~ite38_Out-1413035775|))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out-1413035775| ~z$w_buff1~0_In-1413035775) (not .cse2)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1413035775| ~z~0_In-1413035775) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1413035775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413035775, ~z$w_buff1~0=~z$w_buff1~0_In-1413035775, ~z~0=~z~0_In-1413035775} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1413035775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413035775, ~z$w_buff1~0=~z$w_buff1~0_In-1413035775, ~z~0=~z~0_In-1413035775, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1413035775|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1413035775|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 18:11:41,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1126719429 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1126719429 256)))) (or (and (= ~z$w_buff0_used~0_In1126719429 |P2Thread1of1ForFork2_#t~ite40_Out1126719429|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1126719429|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1126719429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1126719429} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1126719429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1126719429, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1126719429|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 18:11:41,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-352829324 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-352829324 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-352829324 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-352829324 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-352829324|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-352829324 |P2Thread1of1ForFork2_#t~ite41_Out-352829324|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-352829324, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-352829324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-352829324, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-352829324} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-352829324|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-352829324, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-352829324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-352829324, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-352829324} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 18:11:41,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-660104721 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-660104721 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-660104721| ~z$r_buff0_thd3~0_In-660104721) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-660104721|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-660104721, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-660104721} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-660104721|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-660104721, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-660104721} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 18:11:41,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-118094761 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-118094761 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-118094761 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-118094761 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-118094761|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-118094761 |P2Thread1of1ForFork2_#t~ite43_Out-118094761|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-118094761, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-118094761, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-118094761, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-118094761} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-118094761, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-118094761, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-118094761|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-118094761, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-118094761} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 18:11:41,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 18:11:41,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:11:41,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1128090314| |ULTIMATE.start_main_#t~ite47_Out-1128090314|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1128090314 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1128090314 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1128090314 |ULTIMATE.start_main_#t~ite47_Out-1128090314|)) (and .cse0 (not .cse2) (= ~z$w_buff1~0_In-1128090314 |ULTIMATE.start_main_#t~ite47_Out-1128090314|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128090314, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128090314, ~z$w_buff1~0=~z$w_buff1~0_In-1128090314, ~z~0=~z~0_In-1128090314} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128090314, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1128090314|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128090314, ~z$w_buff1~0=~z$w_buff1~0_In-1128090314, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1128090314|, ~z~0=~z~0_In-1128090314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 18:11:41,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-137214086 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-137214086 256) 0))) (or (and (= ~z$w_buff0_used~0_In-137214086 |ULTIMATE.start_main_#t~ite49_Out-137214086|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-137214086|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137214086, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137214086} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137214086, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137214086, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-137214086|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 18:11:41,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-819092378 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-819092378 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-819092378 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-819092378 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-819092378| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-819092378| ~z$w_buff1_used~0_In-819092378)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819092378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819092378, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-819092378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-819092378} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-819092378|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819092378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819092378, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-819092378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-819092378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 18:11:41,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In752503061 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In752503061 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In752503061 |ULTIMATE.start_main_#t~ite51_Out752503061|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out752503061| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In752503061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In752503061} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In752503061, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out752503061|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In752503061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 18:11:41,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In360029157 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In360029157 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In360029157 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In360029157 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out360029157|)) (and (= ~z$r_buff1_thd0~0_In360029157 |ULTIMATE.start_main_#t~ite52_Out360029157|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In360029157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In360029157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In360029157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In360029157} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out360029157|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In360029157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In360029157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In360029157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In360029157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 18:11:41,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~x~0_49 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:11:41,253 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a5dfa17-4d7f-4d91-afb7-478900ba1c42/bin/uautomizer/witness.graphml [2019-12-07 18:11:41,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:11:41,255 INFO L168 Benchmark]: Toolchain (without parser) took 82537.51 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 937.1 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 18:11:41,255 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:11:41,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:11:41,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:11:41,256 INFO L168 Benchmark]: Boogie Preprocessor took 33.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:11:41,256 INFO L168 Benchmark]: RCFGBuilder took 437.50 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 18:11:41,256 INFO L168 Benchmark]: TraceAbstraction took 81549.81 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 18:11:41,256 INFO L168 Benchmark]: Witness Printer took 81.37 ms. Allocated memory is still 7.3 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:11:41,258 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.99 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 33.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 437.50 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 81549.81 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 81.37 ms. Allocated memory is still 7.3 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2296, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2297, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2298, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4619 SDtfs, 5334 SDslu, 12689 SDs, 0 SdLazy, 5257 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191437occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 215242 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 854 ConstructedInterpolants, 0 QuantifiedInterpolants, 167070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...