./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e1c75c07e8ecf18c400b7c2089e688b990558729 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:23:26,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:26,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:26,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:26,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:26,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:26,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:26,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:26,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:26,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:26,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:26,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:26,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:26,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:26,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:26,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:26,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:26,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:26,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:26,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:26,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:26,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:26,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:26,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:26,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:26,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:26,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:26,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:26,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:26,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:26,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:26,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:26,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:26,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:26,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:26,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:26,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:26,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:26,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:26,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:26,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:26,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:23:26,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:26,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:26,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:26,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:26,581 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:26,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:26,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:26,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:26,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:26,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:26,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:26,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:26,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:26,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:26,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:26,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:26,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:26,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:26,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:26,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:26,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:26,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:26,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:26,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:26,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:26,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:26,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:26,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:26,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:26,590 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e1c75c07e8ecf18c400b7c2089e688b990558729 [2019-11-28 18:23:26,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:26,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:26,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:26,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:26,943 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:26,944 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i [2019-11-28 18:23:27,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455a8a8bc/e8ccfb2356de44c9bc9394766ec59384/FLAGd0f405d4d [2019-11-28 18:23:27,595 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:27,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i [2019-11-28 18:23:27,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455a8a8bc/e8ccfb2356de44c9bc9394766ec59384/FLAGd0f405d4d [2019-11-28 18:23:27,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455a8a8bc/e8ccfb2356de44c9bc9394766ec59384 [2019-11-28 18:23:27,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:27,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:27,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:27,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:27,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:27,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e727e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27, skipping insertion in model container [2019-11-28 18:23:27,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:27,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:28,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:28,538 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:28,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:28,698 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:28,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28 WrapperNode [2019-11-28 18:23:28,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:28,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:28,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:28,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:28,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:28,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:28,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:28,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:28,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:28,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:28,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:28,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:28,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:23:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:28,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:28,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:28,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:28,887 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:23:29,584 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:29,584 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:29,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:29 BoogieIcfgContainer [2019-11-28 18:23:29,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:29,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:29,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:29,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:29,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:27" (1/3) ... [2019-11-28 18:23:29,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231523db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:29, skipping insertion in model container [2019-11-28 18:23:29,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28" (2/3) ... [2019-11-28 18:23:29,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231523db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:29, skipping insertion in model container [2019-11-28 18:23:29,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:29" (3/3) ... [2019-11-28 18:23:29,596 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2019-11-28 18:23:29,607 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:29,608 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:29,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:29,618 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:29,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:29,747 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:29,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:29,773 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:29,773 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:29,773 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:29,773 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:29,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:29,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:29,774 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:29,797 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:23:29,800 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:29,914 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:29,914 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:29,931 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:29,956 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:30,004 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:30,005 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:30,014 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:30,033 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:23:30,035 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:34,840 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:23:34,962 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:23:35,407 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-11-28 18:23:35,407 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-11-28 18:23:35,412 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-11-28 18:23:36,225 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-11-28 18:23:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-11-28 18:23:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:23:36,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:36,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:23:36,242 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:36,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-11-28 18:23:36,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:36,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490431800] [2019-11-28 18:23:36,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:36,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490431800] [2019-11-28 18:23:36,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:36,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:36,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438926911] [2019-11-28 18:23:36,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:36,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:36,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:36,503 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-11-28 18:23:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:36,788 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-11-28 18:23:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:36,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:23:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:36,919 INFO L225 Difference]: With dead ends: 9266 [2019-11-28 18:23:36,919 INFO L226 Difference]: Without dead ends: 8258 [2019-11-28 18:23:36,921 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-11-28 18:23:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-11-28 18:23:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-11-28 18:23:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-11-28 18:23:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-11-28 18:23:37,482 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-11-28 18:23:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:37,483 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-11-28 18:23:37,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-11-28 18:23:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:37,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:37,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:37,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:37,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-11-28 18:23:37,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:37,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305498493] [2019-11-28 18:23:37,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:37,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305498493] [2019-11-28 18:23:37,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:37,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:23:37,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883703297] [2019-11-28 18:23:37,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:37,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:37,683 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-11-28 18:23:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:37,763 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-11-28 18:23:37,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:23:37,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:23:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:37,773 INFO L225 Difference]: With dead ends: 1877 [2019-11-28 18:23:37,773 INFO L226 Difference]: Without dead ends: 1373 [2019-11-28 18:23:37,774 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-11-28 18:23:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-11-28 18:23:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-11-28 18:23:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-11-28 18:23:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-11-28 18:23:37,822 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-11-28 18:23:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:37,822 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-11-28 18:23:37,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-11-28 18:23:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:23:37,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:37,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:37,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-11-28 18:23:37,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:37,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776876475] [2019-11-28 18:23:37,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:37,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776876475] [2019-11-28 18:23:37,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:37,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:37,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529074258] [2019-11-28 18:23:37,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:37,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:37,974 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-11-28 18:23:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:38,350 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-11-28 18:23:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:38,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:23:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:38,360 INFO L225 Difference]: With dead ends: 1700 [2019-11-28 18:23:38,361 INFO L226 Difference]: Without dead ends: 1700 [2019-11-28 18:23:38,361 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-11-28 18:23:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-28 18:23:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-11-28 18:23:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-11-28 18:23:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-11-28 18:23:38,419 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-11-28 18:23:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:38,420 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-11-28 18:23:38,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-11-28 18:23:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:23:38,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:38,429 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-11-28 18:23:38,429 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-11-28 18:23:38,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:38,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372499223] [2019-11-28 18:23:38,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:38,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372499223] [2019-11-28 18:23:38,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:38,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:38,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691848748] [2019-11-28 18:23:38,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:38,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:38,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:38,620 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-11-28 18:23:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:39,356 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-11-28 18:23:39,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:39,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:23:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:39,407 INFO L225 Difference]: With dead ends: 4529 [2019-11-28 18:23:39,408 INFO L226 Difference]: Without dead ends: 4494 [2019-11-28 18:23:39,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-11-28 18:23:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-11-28 18:23:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-11-28 18:23:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-11-28 18:23:39,503 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-11-28 18:23:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,504 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-11-28 18:23:39,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-11-28 18:23:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:23:39,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,509 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] [2019-11-28 18:23:39,509 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-11-28 18:23:39,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274673038] [2019-11-28 18:23:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:39,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274673038] [2019-11-28 18:23:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:39,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:39,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38434758] [2019-11-28 18:23:39,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:39,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:39,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:39,695 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 4 states. [2019-11-28 18:23:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:39,732 INFO L93 Difference]: Finished difference Result 3791 states and 8606 transitions. [2019-11-28 18:23:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:23:39,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-28 18:23:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:39,742 INFO L225 Difference]: With dead ends: 3791 [2019-11-28 18:23:39,742 INFO L226 Difference]: Without dead ends: 3166 [2019-11-28 18:23:39,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-11-28 18:23:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3146. [2019-11-28 18:23:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2019-11-28 18:23:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 7212 transitions. [2019-11-28 18:23:39,834 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 7212 transitions. Word has length 26 [2019-11-28 18:23:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,834 INFO L462 AbstractCegarLoop]: Abstraction has 3146 states and 7212 transitions. [2019-11-28 18:23:39,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 7212 transitions. [2019-11-28 18:23:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:23:39,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,841 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] [2019-11-28 18:23:39,841 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-11-28 18:23:39,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992284466] [2019-11-28 18:23:39,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:39,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992284466] [2019-11-28 18:23:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:39,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:39,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116320464] [2019-11-28 18:23:39,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:39,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:39,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:39,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:39,989 INFO L87 Difference]: Start difference. First operand 3146 states and 7212 transitions. Second operand 6 states. [2019-11-28 18:23:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:40,619 INFO L93 Difference]: Finished difference Result 5669 states and 12461 transitions. [2019-11-28 18:23:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:40,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:23:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:40,634 INFO L225 Difference]: With dead ends: 5669 [2019-11-28 18:23:40,634 INFO L226 Difference]: Without dead ends: 5640 [2019-11-28 18:23:40,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2019-11-28 18:23:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 3084. [2019-11-28 18:23:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2019-11-28 18:23:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 7099 transitions. [2019-11-28 18:23:40,760 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 7099 transitions. Word has length 26 [2019-11-28 18:23:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,760 INFO L462 AbstractCegarLoop]: Abstraction has 3084 states and 7099 transitions. [2019-11-28 18:23:40,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 7099 transitions. [2019-11-28 18:23:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:23:40,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,769 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-11-28 18:23:40,770 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-11-28 18:23:40,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777966073] [2019-11-28 18:23:40,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:40,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777966073] [2019-11-28 18:23:40,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:40,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:40,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194594729] [2019-11-28 18:23:40,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:40,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:40,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:40,850 INFO L87 Difference]: Start difference. First operand 3084 states and 7099 transitions. Second operand 3 states. [2019-11-28 18:23:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:40,876 INFO L93 Difference]: Finished difference Result 2959 states and 6701 transitions. [2019-11-28 18:23:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:40,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 18:23:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:40,884 INFO L225 Difference]: With dead ends: 2959 [2019-11-28 18:23:40,884 INFO L226 Difference]: Without dead ends: 2959 [2019-11-28 18:23:40,885 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-11-28 18:23:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2019-11-28 18:23:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2810. [2019-11-28 18:23:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-11-28 18:23:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6417 transitions. [2019-11-28 18:23:40,958 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6417 transitions. Word has length 27 [2019-11-28 18:23:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,959 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6417 transitions. [2019-11-28 18:23:40,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6417 transitions. [2019-11-28 18:23:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:23:40,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,964 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] [2019-11-28 18:23:40,964 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-11-28 18:23:40,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355270639] [2019-11-28 18:23:40,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:41,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355270639] [2019-11-28 18:23:41,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:41,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018813461] [2019-11-28 18:23:41,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:23:41,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:23:41,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:41,082 INFO L87 Difference]: Start difference. First operand 2810 states and 6417 transitions. Second operand 5 states. [2019-11-28 18:23:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,126 INFO L93 Difference]: Finished difference Result 1471 states and 3338 transitions. [2019-11-28 18:23:41,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:41,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:23:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,131 INFO L225 Difference]: With dead ends: 1471 [2019-11-28 18:23:41,131 INFO L226 Difference]: Without dead ends: 1312 [2019-11-28 18:23:41,132 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-11-28 18:23:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-11-28 18:23:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 841. [2019-11-28 18:23:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-28 18:23:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1889 transitions. [2019-11-28 18:23:41,157 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1889 transitions. Word has length 28 [2019-11-28 18:23:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,158 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1889 transitions. [2019-11-28 18:23:41,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:23:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1889 transitions. [2019-11-28 18:23:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:23:41,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,163 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] [2019-11-28 18:23:41,164 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-11-28 18:23:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690020471] [2019-11-28 18:23:41,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:41,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690020471] [2019-11-28 18:23:41,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:23:41,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594091056] [2019-11-28 18:23:41,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:23:41,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:23:41,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:41,330 INFO L87 Difference]: Start difference. First operand 841 states and 1889 transitions. Second operand 7 states. [2019-11-28 18:23:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,836 INFO L93 Difference]: Finished difference Result 3683 states and 8144 transitions. [2019-11-28 18:23:41,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:23:41,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:23:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,844 INFO L225 Difference]: With dead ends: 3683 [2019-11-28 18:23:41,845 INFO L226 Difference]: Without dead ends: 2415 [2019-11-28 18:23:41,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:23:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2019-11-28 18:23:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 969. [2019-11-28 18:23:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-28 18:23:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2162 transitions. [2019-11-28 18:23:41,882 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2162 transitions. Word has length 52 [2019-11-28 18:23:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,883 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2162 transitions. [2019-11-28 18:23:41,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:23:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2162 transitions. [2019-11-28 18:23:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:23:41,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,887 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] [2019-11-28 18:23:41,887 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash -744775922, now seen corresponding path program 2 times [2019-11-28 18:23:41,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278104840] [2019-11-28 18:23:41,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:42,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278104840] [2019-11-28 18:23:42,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:42,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:23:42,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599552894] [2019-11-28 18:23:42,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:23:42,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:23:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:42,126 INFO L87 Difference]: Start difference. First operand 969 states and 2162 transitions. Second operand 7 states. [2019-11-28 18:23:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:43,413 INFO L93 Difference]: Finished difference Result 2463 states and 5276 transitions. [2019-11-28 18:23:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 18:23:43,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:23:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:43,422 INFO L225 Difference]: With dead ends: 2463 [2019-11-28 18:23:43,422 INFO L226 Difference]: Without dead ends: 2439 [2019-11-28 18:23:43,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:23:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2019-11-28 18:23:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1199. [2019-11-28 18:23:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-11-28 18:23:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2650 transitions. [2019-11-28 18:23:43,462 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2650 transitions. Word has length 52 [2019-11-28 18:23:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:43,462 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 2650 transitions. [2019-11-28 18:23:43,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:23:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2650 transitions. [2019-11-28 18:23:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:23:43,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:43,466 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] [2019-11-28 18:23:43,466 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1616489678, now seen corresponding path program 3 times [2019-11-28 18:23:43,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:43,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404630529] [2019-11-28 18:23:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:43,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404630529] [2019-11-28 18:23:43,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:43,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:43,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12941365] [2019-11-28 18:23:43,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:43,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:43,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:43,566 INFO L87 Difference]: Start difference. First operand 1199 states and 2650 transitions. Second operand 3 states. [2019-11-28 18:23:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:43,654 INFO L93 Difference]: Finished difference Result 1448 states and 3172 transitions. [2019-11-28 18:23:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:43,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:23:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:43,660 INFO L225 Difference]: With dead ends: 1448 [2019-11-28 18:23:43,660 INFO L226 Difference]: Without dead ends: 1448 [2019-11-28 18:23:43,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-11-28 18:23:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1108. [2019-11-28 18:23:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2019-11-28 18:23:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 2444 transitions. [2019-11-28 18:23:43,694 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 2444 transitions. Word has length 52 [2019-11-28 18:23:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:43,695 INFO L462 AbstractCegarLoop]: Abstraction has 1108 states and 2444 transitions. [2019-11-28 18:23:43,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 2444 transitions. [2019-11-28 18:23:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:43,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:43,699 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] [2019-11-28 18:23:43,699 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:43,700 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-11-28 18:23:43,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:43,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719312342] [2019-11-28 18:23:43,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:43,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:23:43,870 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:23:43,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_18|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24|) |v_ULTIMATE.start_main_~#t1713~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_24|) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24|)) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:43,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:43,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:23:43,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1829356840 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1829356840 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1829356840 |P0Thread1of1ForFork0_#t~ite5_Out-1829356840|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1829356840|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1829356840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1829356840} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1829356840|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1829356840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1829356840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:43,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1580840660 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1580840660 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1580840660 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd2~0_In1580840660 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1580840660 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out1580840660| |P1Thread1of1ForFork1_#t~ite14_Out1580840660|) (= ~x$w_buff0~0_In1580840660 |P1Thread1of1ForFork1_#t~ite14_Out1580840660|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1580840660| |P1Thread1of1ForFork1_#t~ite14_Out1580840660|) (= |P1Thread1of1ForFork1_#t~ite15_Out1580840660| ~x$w_buff0~0_In1580840660)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1580840660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1580840660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1580840660, ~weak$$choice2~0=~weak$$choice2~0_In1580840660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1580840660, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1580840660|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1580840660} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1580840660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1580840660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1580840660, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1580840660|, ~weak$$choice2~0=~weak$$choice2~0_In1580840660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1580840660, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1580840660|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1580840660} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:43,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1057586366 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1057586366 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1057586366 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1057586366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1057586366|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1057586366| ~x$w_buff1_used~0_In-1057586366)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1057586366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057586366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1057586366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057586366} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1057586366|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1057586366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057586366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1057586366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057586366} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:43,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_Out1142540695 ~x$r_buff0_thd1~0_In1142540695)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1142540695 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1142540695 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~x$r_buff0_thd1~0_Out1142540695 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1142540695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142540695} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1142540695, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1142540695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142540695} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:43,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-549502459 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-549502459 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-549502459 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-549502459 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-549502459| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-549502459| ~x$r_buff1_thd1~0_In-549502459) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-549502459, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-549502459, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-549502459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-549502459} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-549502459, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-549502459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-549502459, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-549502459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-549502459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:43,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:43,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1679647422 256)))) (or (and (= ~x$w_buff1~0_In1679647422 |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1679647422 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1679647422 256)) (and (= 0 (mod ~x$r_buff1_thd2~0_In1679647422 256)) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In1679647422 256) 0)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| ~x$w_buff1~0_In1679647422) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1679647422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1679647422, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1679647422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1679647422} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1679647422|, ~x$w_buff1~0=~x$w_buff1~0_In1679647422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1679647422, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1679647422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1679647422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:43,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1331106573 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1331106573| |P1Thread1of1ForFork1_#t~ite20_Out1331106573|) (= ~x$w_buff0_used~0_In1331106573 |P1Thread1of1ForFork1_#t~ite21_Out1331106573|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1331106573| |P1Thread1of1ForFork1_#t~ite21_Out1331106573|) (= |P1Thread1of1ForFork1_#t~ite20_Out1331106573| ~x$w_buff0_used~0_In1331106573) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1331106573 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1331106573 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In1331106573 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1331106573 256))))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1331106573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1331106573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1331106573, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1331106573, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331106573} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1331106573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1331106573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1331106573, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1331106573|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1331106573, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331106573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:43,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:43,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2038232838 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2038232838| |P1Thread1of1ForFork1_#t~ite30_Out-2038232838|) (= |P1Thread1of1ForFork1_#t~ite29_Out-2038232838| ~x$r_buff1_thd2~0_In-2038232838) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2038232838 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2038232838 256))) (and (= 0 (mod ~x$w_buff1_used~0_In-2038232838 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-2038232838 256))))) (and (not .cse0) (= ~x$r_buff1_thd2~0_In-2038232838 |P1Thread1of1ForFork1_#t~ite30_Out-2038232838|) (= |P1Thread1of1ForFork1_#t~ite29_In-2038232838| |P1Thread1of1ForFork1_#t~ite29_Out-2038232838|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2038232838|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2038232838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2038232838, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2038232838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2038232838} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2038232838|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2038232838|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2038232838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2038232838, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2038232838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2038232838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:43,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-969218201 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-969218201 256) 0))) (or (and (= ~x~0_In-969218201 |P1Thread1of1ForFork1_#t~ite32_Out-969218201|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-969218201| ~x$w_buff1~0_In-969218201) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-969218201, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969218201, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969218201, ~x~0=~x~0_In-969218201} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-969218201, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969218201, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969218201, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-969218201|, ~x~0=~x~0_In-969218201} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:43,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-430635939 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-430635939 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-430635939 |P1Thread1of1ForFork1_#t~ite34_Out-430635939|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-430635939| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-430635939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-430635939} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-430635939|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-430635939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-430635939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:43,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1895488714 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1895488714 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1895488714 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1895488714 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| ~x$w_buff1_used~0_In-1895488714) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1895488714, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1895488714, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1895488714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1895488714} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1895488714, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1895488714, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1895488714|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1895488714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1895488714} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:43,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1941100110 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1941100110 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1941100110| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1941100110| ~x$r_buff0_thd2~0_In1941100110) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1941100110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1941100110} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1941100110, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1941100110|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1941100110} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:43,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1071163343 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1071163343 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1071163343 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1071163343 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1071163343|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1071163343| ~x$r_buff1_thd2~0_In1071163343) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1071163343, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1071163343, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1071163343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071163343} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1071163343, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1071163343, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1071163343, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1071163343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071163343} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:43,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:43,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:43,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In204821837 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In204821837 256) 0))) (or (and (= ~x~0_In204821837 |ULTIMATE.start_main_#t~ite40_Out204821837|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In204821837 |ULTIMATE.start_main_#t~ite40_Out204821837|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In204821837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In204821837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In204821837, ~x~0=~x~0_In204821837} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out204821837|, ~x$w_buff1~0=~x$w_buff1~0_In204821837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In204821837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In204821837, ~x~0=~x~0_In204821837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:43,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-478704613 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-478704613 256) 0))) (or (and (= ~x$w_buff0_used~0_In-478704613 |ULTIMATE.start_main_#t~ite42_Out-478704613|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-478704613|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-478704613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478704613} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-478704613, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-478704613|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478704613} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:43,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In342406594 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In342406594 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In342406594 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In342406594 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out342406594| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In342406594 |ULTIMATE.start_main_#t~ite43_Out342406594|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In342406594, ~x$w_buff1_used~0=~x$w_buff1_used~0_In342406594, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In342406594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In342406594} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In342406594, ~x$w_buff1_used~0=~x$w_buff1_used~0_In342406594, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out342406594|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In342406594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In342406594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:43,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In706062439 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In706062439 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out706062439| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In706062439 |ULTIMATE.start_main_#t~ite44_Out706062439|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In706062439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In706062439} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In706062439, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out706062439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In706062439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:43,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-896322705 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-896322705 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-896322705 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-896322705 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-896322705| ~x$r_buff1_thd0~0_In-896322705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-896322705|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-896322705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896322705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-896322705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-896322705} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-896322705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896322705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-896322705, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-896322705|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-896322705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:43,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:23:44,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:23:44 BasicIcfg [2019-11-28 18:23:44,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:23:44,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:23:44,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:23:44,001 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:23:44,002 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:29" (3/4) ... [2019-11-28 18:23:44,008 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:23:44,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_18|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24|) |v_ULTIMATE.start_main_~#t1713~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_24|) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24|)) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:44,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:44,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:23:44,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1829356840 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1829356840 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1829356840 |P0Thread1of1ForFork0_#t~ite5_Out-1829356840|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1829356840|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1829356840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1829356840} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1829356840|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1829356840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1829356840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:44,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1580840660 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1580840660 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1580840660 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd2~0_In1580840660 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1580840660 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out1580840660| |P1Thread1of1ForFork1_#t~ite14_Out1580840660|) (= ~x$w_buff0~0_In1580840660 |P1Thread1of1ForFork1_#t~ite14_Out1580840660|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1580840660| |P1Thread1of1ForFork1_#t~ite14_Out1580840660|) (= |P1Thread1of1ForFork1_#t~ite15_Out1580840660| ~x$w_buff0~0_In1580840660)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1580840660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1580840660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1580840660, ~weak$$choice2~0=~weak$$choice2~0_In1580840660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1580840660, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1580840660|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1580840660} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1580840660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1580840660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1580840660, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1580840660|, ~weak$$choice2~0=~weak$$choice2~0_In1580840660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1580840660, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1580840660|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1580840660} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:44,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1057586366 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1057586366 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1057586366 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1057586366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1057586366|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1057586366| ~x$w_buff1_used~0_In-1057586366)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1057586366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057586366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1057586366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057586366} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1057586366|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1057586366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1057586366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1057586366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057586366} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:44,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_Out1142540695 ~x$r_buff0_thd1~0_In1142540695)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1142540695 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1142540695 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~x$r_buff0_thd1~0_Out1142540695 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1142540695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142540695} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1142540695, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1142540695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142540695} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:44,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-549502459 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-549502459 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-549502459 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-549502459 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-549502459| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-549502459| ~x$r_buff1_thd1~0_In-549502459) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-549502459, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-549502459, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-549502459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-549502459} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-549502459, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-549502459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-549502459, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-549502459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-549502459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:44,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:44,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1679647422 256)))) (or (and (= ~x$w_buff1~0_In1679647422 |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1679647422 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1679647422 256)) (and (= 0 (mod ~x$r_buff1_thd2~0_In1679647422 256)) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In1679647422 256) 0)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| ~x$w_buff1~0_In1679647422) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1679647422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1679647422, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1679647422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1679647422} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1679647422|, ~x$w_buff1~0=~x$w_buff1~0_In1679647422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1679647422, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1679647422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1679647422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:44,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1331106573 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1331106573| |P1Thread1of1ForFork1_#t~ite20_Out1331106573|) (= ~x$w_buff0_used~0_In1331106573 |P1Thread1of1ForFork1_#t~ite21_Out1331106573|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1331106573| |P1Thread1of1ForFork1_#t~ite21_Out1331106573|) (= |P1Thread1of1ForFork1_#t~ite20_Out1331106573| ~x$w_buff0_used~0_In1331106573) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1331106573 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1331106573 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In1331106573 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1331106573 256))))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1331106573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1331106573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1331106573, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1331106573, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331106573} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1331106573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1331106573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1331106573, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1331106573|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1331106573, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331106573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:44,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:44,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2038232838 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2038232838| |P1Thread1of1ForFork1_#t~ite30_Out-2038232838|) (= |P1Thread1of1ForFork1_#t~ite29_Out-2038232838| ~x$r_buff1_thd2~0_In-2038232838) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2038232838 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2038232838 256))) (and (= 0 (mod ~x$w_buff1_used~0_In-2038232838 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-2038232838 256))))) (and (not .cse0) (= ~x$r_buff1_thd2~0_In-2038232838 |P1Thread1of1ForFork1_#t~ite30_Out-2038232838|) (= |P1Thread1of1ForFork1_#t~ite29_In-2038232838| |P1Thread1of1ForFork1_#t~ite29_Out-2038232838|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2038232838|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2038232838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2038232838, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2038232838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2038232838} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2038232838|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2038232838|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2038232838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2038232838, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2038232838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2038232838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:44,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-969218201 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-969218201 256) 0))) (or (and (= ~x~0_In-969218201 |P1Thread1of1ForFork1_#t~ite32_Out-969218201|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-969218201| ~x$w_buff1~0_In-969218201) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-969218201, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969218201, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969218201, ~x~0=~x~0_In-969218201} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-969218201, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969218201, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969218201, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-969218201|, ~x~0=~x~0_In-969218201} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:44,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-430635939 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-430635939 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-430635939 |P1Thread1of1ForFork1_#t~ite34_Out-430635939|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-430635939| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-430635939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-430635939} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-430635939|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-430635939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-430635939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:44,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1895488714 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1895488714 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1895488714 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1895488714 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| ~x$w_buff1_used~0_In-1895488714) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1895488714, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1895488714, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1895488714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1895488714} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1895488714, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1895488714, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1895488714|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1895488714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1895488714} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:44,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1941100110 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1941100110 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1941100110| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1941100110| ~x$r_buff0_thd2~0_In1941100110) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1941100110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1941100110} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1941100110, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1941100110|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1941100110} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:44,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1071163343 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1071163343 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1071163343 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1071163343 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1071163343|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1071163343| ~x$r_buff1_thd2~0_In1071163343) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1071163343, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1071163343, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1071163343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071163343} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1071163343, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1071163343, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1071163343, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1071163343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071163343} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:44,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:44,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:44,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In204821837 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In204821837 256) 0))) (or (and (= ~x~0_In204821837 |ULTIMATE.start_main_#t~ite40_Out204821837|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In204821837 |ULTIMATE.start_main_#t~ite40_Out204821837|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In204821837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In204821837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In204821837, ~x~0=~x~0_In204821837} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out204821837|, ~x$w_buff1~0=~x$w_buff1~0_In204821837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In204821837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In204821837, ~x~0=~x~0_In204821837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:44,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-478704613 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-478704613 256) 0))) (or (and (= ~x$w_buff0_used~0_In-478704613 |ULTIMATE.start_main_#t~ite42_Out-478704613|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-478704613|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-478704613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478704613} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-478704613, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-478704613|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478704613} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:44,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In342406594 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In342406594 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In342406594 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In342406594 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out342406594| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In342406594 |ULTIMATE.start_main_#t~ite43_Out342406594|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In342406594, ~x$w_buff1_used~0=~x$w_buff1_used~0_In342406594, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In342406594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In342406594} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In342406594, ~x$w_buff1_used~0=~x$w_buff1_used~0_In342406594, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out342406594|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In342406594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In342406594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:44,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In706062439 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In706062439 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out706062439| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In706062439 |ULTIMATE.start_main_#t~ite44_Out706062439|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In706062439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In706062439} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In706062439, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out706062439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In706062439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:44,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-896322705 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-896322705 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-896322705 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-896322705 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-896322705| ~x$r_buff1_thd0~0_In-896322705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-896322705|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-896322705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896322705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-896322705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-896322705} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-896322705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896322705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-896322705, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-896322705|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-896322705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:44,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:23:44,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:23:44,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:23:44,141 INFO L168 Benchmark]: Toolchain (without parser) took 16264.46 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -120.4 MB). Peak memory consumption was 315.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:44,145 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:23:44,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -119.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:44,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.51 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-11-28 18:23:44,147 INFO L168 Benchmark]: Boogie Preprocessor took 45.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:44,147 INFO L168 Benchmark]: RCFGBuilder took 757.97 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:44,148 INFO L168 Benchmark]: TraceAbstraction took 14413.14 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -70.7 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:44,148 INFO L168 Benchmark]: Witness Printer took 138.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:44,150 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 820.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -119.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 757.97 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14413.14 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -70.7 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. * Witness Printer took 138.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1682 SDtfs, 1891 SDslu, 3803 SDs, 0 SdLazy, 2080 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 8584 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 65237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...