./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_pso.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/mix034_pso.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 3c9d871b0ec3e076c45b0ea77629e1601bdb3a53 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12:23,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:23,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:23,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:23,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:23,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:23,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:23,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:23,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:23,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:23,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:23,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:23,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:23,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:23,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:23,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:23,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:23,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:23,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:23,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:23,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:23,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:23,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:23,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:23,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:23,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:23,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:23,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:23,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:23,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:23,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:23,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:23,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:23,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:23,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:23,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:23,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:23,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:23,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:23,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:23,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:23,546 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:12:23,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:23,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:23,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:23,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:23,569 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:23,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:23,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:23,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:23,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:23,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:23,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:23,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:23,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:23,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:23,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:23,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:23,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:23,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:23,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:23,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:23,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:23,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:23,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:23,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:23,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:23,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:23,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:23,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:23,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:23,576 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 -> 3c9d871b0ec3e076c45b0ea77629e1601bdb3a53 [2019-11-28 18:12:23,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:23,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:23,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:23,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:23,929 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:23,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i [2019-11-28 18:12:23,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ec5d8f2/d7a9f3238d834005ad555d5b2ea99ddb/FLAG695c63246 [2019-11-28 18:12:24,490 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:24,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i [2019-11-28 18:12:24,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ec5d8f2/d7a9f3238d834005ad555d5b2ea99ddb/FLAG695c63246 [2019-11-28 18:12:24,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ec5d8f2/d7a9f3238d834005ad555d5b2ea99ddb [2019-11-28 18:12:24,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:24,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:24,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:24,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:24,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:24,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:24" (1/1) ... [2019-11-28 18:12:24,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b836fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:24, skipping insertion in model container [2019-11-28 18:12:24,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:24" (1/1) ... [2019-11-28 18:12:24,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:24,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:25,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:25,448 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:25,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:25,630 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:25,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25 WrapperNode [2019-11-28 18:12:25,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:25,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:25,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:25,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:25,639 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:12:25" (1/1) ... [2019-11-28 18:12:25,658 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:12:25" (1/1) ... [2019-11-28 18:12:25,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:25,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:25,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:25,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:25,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:25,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:25,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:25,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:25,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (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:12:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:25,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:25,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:25,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:25,871 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:12:26,597 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:26,597 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:26,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:26 BoogieIcfgContainer [2019-11-28 18:12:26,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:26,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:26,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:26,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:26,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:24" (1/3) ... [2019-11-28 18:12:26,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17db214a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:26, skipping insertion in model container [2019-11-28 18:12:26,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25" (2/3) ... [2019-11-28 18:12:26,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17db214a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:26, skipping insertion in model container [2019-11-28 18:12:26,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:26" (3/3) ... [2019-11-28 18:12:26,608 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2019-11-28 18:12:26,619 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:26,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:26,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:26,628 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:26,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:26,735 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:12:26,757 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:26,758 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:26,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:26,758 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:26,759 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:26,759 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:26,759 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:26,759 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:26,778 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-11-28 18:12:26,780 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:26,861 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:26,862 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:26,877 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:26,905 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:26,988 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:26,988 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:27,002 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:27,029 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:12:27,030 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:32,197 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:12:32,312 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:12:32,545 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-11-28 18:12:32,545 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-11-28 18:12:32,549 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-11-28 18:12:33,087 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-11-28 18:12:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-11-28 18:12:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:12:33,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:33,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:12:33,096 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:12:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-11-28 18:12:33,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:33,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512870065] [2019-11-28 18:12:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:33,379 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:12:33,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512870065] [2019-11-28 18:12:33,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:33,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:33,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954337652] [2019-11-28 18:12:33,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:33,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:33,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:33,409 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-11-28 18:12:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:33,724 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-11-28 18:12:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:33,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:12:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:33,857 INFO L225 Difference]: With dead ends: 8598 [2019-11-28 18:12:33,866 INFO L226 Difference]: Without dead ends: 7662 [2019-11-28 18:12:33,868 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:12:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-11-28 18:12:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-11-28 18:12:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-11-28 18:12:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-11-28 18:12:34,288 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-11-28 18:12:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,288 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-11-28 18:12:34,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-11-28 18:12:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:12:34,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:34,293 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:12:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-11-28 18:12:34,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949078017] [2019-11-28 18:12:34,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,424 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:12:34,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949078017] [2019-11-28 18:12:34,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:34,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354701386] [2019-11-28 18:12:34,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:34,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:34,431 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-11-28 18:12:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,489 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-11-28 18:12:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:34,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:12:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,500 INFO L225 Difference]: With dead ends: 1232 [2019-11-28 18:12:34,500 INFO L226 Difference]: Without dead ends: 1232 [2019-11-28 18:12:34,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-28 18:12:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-11-28 18:12:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-11-28 18:12:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-11-28 18:12:34,545 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-11-28 18:12:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,546 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-11-28 18:12:34,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-11-28 18:12:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:34,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:34,555 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:12:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-11-28 18:12:34,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184647342] [2019-11-28 18:12:34,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,647 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:12:34,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184647342] [2019-11-28 18:12:34,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:34,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417553864] [2019-11-28 18:12:34,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:34,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:34,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:34,650 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-11-28 18:12:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,733 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-11-28 18:12:34,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:34,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:12:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,749 INFO L225 Difference]: With dead ends: 1943 [2019-11-28 18:12:34,749 INFO L226 Difference]: Without dead ends: 1943 [2019-11-28 18:12:34,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-11-28 18:12:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-11-28 18:12:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-11-28 18:12:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-11-28 18:12:34,814 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-11-28 18:12:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,815 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-11-28 18:12:34,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-11-28 18:12:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:34,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:34,817 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:12:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-11-28 18:12:34,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549442248] [2019-11-28 18:12:34,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,898 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:12:34,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549442248] [2019-11-28 18:12:34,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:34,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529810] [2019-11-28 18:12:34,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:34,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:34,900 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-11-28 18:12:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:35,151 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-11-28 18:12:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:35,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:35,164 INFO L225 Difference]: With dead ends: 1724 [2019-11-28 18:12:35,165 INFO L226 Difference]: Without dead ends: 1724 [2019-11-28 18:12:35,165 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:12:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-11-28 18:12:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-11-28 18:12:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-11-28 18:12:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-11-28 18:12:35,224 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-11-28 18:12:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:35,224 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-11-28 18:12:35,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-11-28 18:12:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:35,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:35,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:35,226 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:12:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-11-28 18:12:35,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:35,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859546399] [2019-11-28 18:12:35,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:35,335 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:12:35,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859546399] [2019-11-28 18:12:35,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:35,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:35,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517445391] [2019-11-28 18:12:35,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:35,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:35,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:35,338 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-11-28 18:12:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:35,533 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-11-28 18:12:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:35,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:35,545 INFO L225 Difference]: With dead ends: 1991 [2019-11-28 18:12:35,547 INFO L226 Difference]: Without dead ends: 1991 [2019-11-28 18:12:35,547 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:12:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-28 18:12:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-11-28 18:12:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-11-28 18:12:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-11-28 18:12:35,597 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-11-28 18:12:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:35,598 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-11-28 18:12:35,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-11-28 18:12:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:12:35,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:35,604 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] [2019-11-28 18:12:35,604 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:12:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-11-28 18:12:35,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:35,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946109622] [2019-11-28 18:12:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:35,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946109622] [2019-11-28 18:12:35,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:35,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:35,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968909290] [2019-11-28 18:12:35,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:35,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:35,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:35,790 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-11-28 18:12:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,106 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-11-28 18:12:36,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:36,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 18:12:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,124 INFO L225 Difference]: With dead ends: 2258 [2019-11-28 18:12:36,124 INFO L226 Difference]: Without dead ends: 2258 [2019-11-28 18:12:36,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-11-28 18:12:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-11-28 18:12:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-11-28 18:12:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-11-28 18:12:36,170 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-11-28 18:12:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,171 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-11-28 18:12:36,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-11-28 18:12:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:36,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,174 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:12:36,174 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:12:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-11-28 18:12:36,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661730570] [2019-11-28 18:12:36,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,244 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:12:36,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661730570] [2019-11-28 18:12:36,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:36,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86297860] [2019-11-28 18:12:36,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:36,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:36,246 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 5 states. [2019-11-28 18:12:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,709 INFO L93 Difference]: Finished difference Result 2854 states and 6297 transitions. [2019-11-28 18:12:36,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:36,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,718 INFO L225 Difference]: With dead ends: 2854 [2019-11-28 18:12:36,718 INFO L226 Difference]: Without dead ends: 2854 [2019-11-28 18:12:36,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2019-11-28 18:12:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2447. [2019-11-28 18:12:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-28 18:12:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 5484 transitions. [2019-11-28 18:12:36,776 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 5484 transitions. Word has length 26 [2019-11-28 18:12:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,776 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 5484 transitions. [2019-11-28 18:12:36,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 5484 transitions. [2019-11-28 18:12:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:36,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,780 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:12:36,780 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:12:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,781 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-11-28 18:12:36,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440011409] [2019-11-28 18:12:36,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:36,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440011409] [2019-11-28 18:12:36,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:36,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639763283] [2019-11-28 18:12:36,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:36,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:36,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:36,860 INFO L87 Difference]: Start difference. First operand 2447 states and 5484 transitions. Second operand 5 states. [2019-11-28 18:12:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,924 INFO L93 Difference]: Finished difference Result 2571 states and 5724 transitions. [2019-11-28 18:12:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:36,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,931 INFO L225 Difference]: With dead ends: 2571 [2019-11-28 18:12:36,931 INFO L226 Difference]: Without dead ends: 2571 [2019-11-28 18:12:36,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-11-28 18:12:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2571. [2019-11-28 18:12:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-11-28 18:12:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 5724 transitions. [2019-11-28 18:12:36,986 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 5724 transitions. Word has length 26 [2019-11-28 18:12:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,987 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 5724 transitions. [2019-11-28 18:12:36,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 5724 transitions. [2019-11-28 18:12:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:12:36,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,991 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:12:36,991 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:12:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 461323697, now seen corresponding path program 1 times [2019-11-28 18:12:36,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415025401] [2019-11-28 18:12:36,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:37,249 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:12:37,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415025401] [2019-11-28 18:12:37,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:37,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:37,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160842465] [2019-11-28 18:12:37,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:12:37,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:37,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:12:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:12:37,254 INFO L87 Difference]: Start difference. First operand 2571 states and 5724 transitions. Second operand 8 states. [2019-11-28 18:12:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:37,447 INFO L93 Difference]: Finished difference Result 2570 states and 5722 transitions. [2019-11-28 18:12:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:12:37,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-28 18:12:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:37,454 INFO L225 Difference]: With dead ends: 2570 [2019-11-28 18:12:37,454 INFO L226 Difference]: Without dead ends: 2570 [2019-11-28 18:12:37,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:12:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-11-28 18:12:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2570. [2019-11-28 18:12:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-11-28 18:12:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 5722 transitions. [2019-11-28 18:12:37,506 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 5722 transitions. Word has length 27 [2019-11-28 18:12:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:37,506 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 5722 transitions. [2019-11-28 18:12:37,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:12:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 5722 transitions. [2019-11-28 18:12:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:12:37,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:37,511 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:12:37,511 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:12:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-11-28 18:12:37,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:37,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987705367] [2019-11-28 18:12:37,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:37,590 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:12:37,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987705367] [2019-11-28 18:12:37,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:37,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:37,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913862879] [2019-11-28 18:12:37,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:37,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:37,592 INFO L87 Difference]: Start difference. First operand 2570 states and 5722 transitions. Second operand 5 states. [2019-11-28 18:12:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:37,862 INFO L93 Difference]: Finished difference Result 3072 states and 6694 transitions. [2019-11-28 18:12:37,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:37,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:12:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:37,871 INFO L225 Difference]: With dead ends: 3072 [2019-11-28 18:12:37,871 INFO L226 Difference]: Without dead ends: 3072 [2019-11-28 18:12:37,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-11-28 18:12:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2505. [2019-11-28 18:12:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-11-28 18:12:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5590 transitions. [2019-11-28 18:12:37,929 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5590 transitions. Word has length 27 [2019-11-28 18:12:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:37,930 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 5590 transitions. [2019-11-28 18:12:37,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5590 transitions. [2019-11-28 18:12:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:12:37,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:37,935 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:12:37,935 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:12:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-11-28 18:12:37,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:37,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77111021] [2019-11-28 18:12:37,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:37,985 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:12:37,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77111021] [2019-11-28 18:12:37,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:37,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:37,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136088881] [2019-11-28 18:12:37,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:37,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:37,987 INFO L87 Difference]: Start difference. First operand 2505 states and 5590 transitions. Second operand 4 states. [2019-11-28 18:12:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:38,064 INFO L93 Difference]: Finished difference Result 1400 states and 2990 transitions. [2019-11-28 18:12:38,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:38,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:12:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:38,068 INFO L225 Difference]: With dead ends: 1400 [2019-11-28 18:12:38,069 INFO L226 Difference]: Without dead ends: 1400 [2019-11-28 18:12:38,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-11-28 18:12:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1305. [2019-11-28 18:12:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-11-28 18:12:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2815 transitions. [2019-11-28 18:12:38,096 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2815 transitions. Word has length 28 [2019-11-28 18:12:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:38,097 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 2815 transitions. [2019-11-28 18:12:38,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2815 transitions. [2019-11-28 18:12:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:12:38,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:38,102 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] [2019-11-28 18:12:38,102 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:12:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-11-28 18:12:38,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:38,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903503508] [2019-11-28 18:12:38,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:38,222 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:12:38,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903503508] [2019-11-28 18:12:38,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:38,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:38,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394947801] [2019-11-28 18:12:38,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:12:38,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:12:38,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:38,224 INFO L87 Difference]: Start difference. First operand 1305 states and 2815 transitions. Second operand 6 states. [2019-11-28 18:12:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:38,810 INFO L93 Difference]: Finished difference Result 1711 states and 3585 transitions. [2019-11-28 18:12:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:12:38,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-28 18:12:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:38,816 INFO L225 Difference]: With dead ends: 1711 [2019-11-28 18:12:38,816 INFO L226 Difference]: Without dead ends: 1711 [2019-11-28 18:12:38,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:12:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-11-28 18:12:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1359. [2019-11-28 18:12:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-11-28 18:12:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2922 transitions. [2019-11-28 18:12:38,844 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2922 transitions. Word has length 50 [2019-11-28 18:12:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:38,844 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 2922 transitions. [2019-11-28 18:12:38,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:12:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2922 transitions. [2019-11-28 18:12:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:12:38,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:38,848 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] [2019-11-28 18:12:38,848 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1640582438, now seen corresponding path program 2 times [2019-11-28 18:12:38,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:38,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224374504] [2019-11-28 18:12:38,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:38,905 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:12:38,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224374504] [2019-11-28 18:12:38,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:38,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:38,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718359798] [2019-11-28 18:12:38,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:38,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:38,907 INFO L87 Difference]: Start difference. First operand 1359 states and 2922 transitions. Second operand 3 states. [2019-11-28 18:12:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:38,963 INFO L93 Difference]: Finished difference Result 1646 states and 3485 transitions. [2019-11-28 18:12:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:38,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:12:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:38,968 INFO L225 Difference]: With dead ends: 1646 [2019-11-28 18:12:38,968 INFO L226 Difference]: Without dead ends: 1646 [2019-11-28 18:12:38,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-28 18:12:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1369. [2019-11-28 18:12:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-11-28 18:12:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2940 transitions. [2019-11-28 18:12:38,995 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2940 transitions. Word has length 50 [2019-11-28 18:12:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:38,997 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 2940 transitions. [2019-11-28 18:12:38,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2940 transitions. [2019-11-28 18:12:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:12:39,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,001 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] [2019-11-28 18:12:39,001 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash -475366277, now seen corresponding path program 1 times [2019-11-28 18:12:39,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762375642] [2019-11-28 18:12:39,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:39,064 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:12:39,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762375642] [2019-11-28 18:12:39,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:39,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:39,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709403938] [2019-11-28 18:12:39,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:39,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:39,066 INFO L87 Difference]: Start difference. First operand 1369 states and 2940 transitions. Second operand 3 states. [2019-11-28 18:12:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:39,084 INFO L93 Difference]: Finished difference Result 1368 states and 2938 transitions. [2019-11-28 18:12:39,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:39,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:12:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:39,089 INFO L225 Difference]: With dead ends: 1368 [2019-11-28 18:12:39,089 INFO L226 Difference]: Without dead ends: 1368 [2019-11-28 18:12:39,089 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:12:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-11-28 18:12:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1106. [2019-11-28 18:12:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-11-28 18:12:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2429 transitions. [2019-11-28 18:12:39,111 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2429 transitions. Word has length 51 [2019-11-28 18:12:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:39,111 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 2429 transitions. [2019-11-28 18:12:39,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2429 transitions. [2019-11-28 18:12:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:39,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,115 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:12:39,115 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-11-28 18:12:39,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873391479] [2019-11-28 18:12:39,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:39,586 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:12:39,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873391479] [2019-11-28 18:12:39,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:39,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:12:39,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678971732] [2019-11-28 18:12:39,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 18:12:39,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 18:12:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:12:39,588 INFO L87 Difference]: Start difference. First operand 1106 states and 2429 transitions. Second operand 14 states. [2019-11-28 18:12:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:40,657 INFO L93 Difference]: Finished difference Result 1651 states and 3527 transitions. [2019-11-28 18:12:40,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:12:40,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-11-28 18:12:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:40,661 INFO L225 Difference]: With dead ends: 1651 [2019-11-28 18:12:40,661 INFO L226 Difference]: Without dead ends: 1252 [2019-11-28 18:12:40,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-28 18:12:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-11-28 18:12:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1141. [2019-11-28 18:12:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2019-11-28 18:12:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 2476 transitions. [2019-11-28 18:12:40,681 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 2476 transitions. Word has length 52 [2019-11-28 18:12:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:40,682 INFO L462 AbstractCegarLoop]: Abstraction has 1141 states and 2476 transitions. [2019-11-28 18:12:40,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 18:12:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 2476 transitions. [2019-11-28 18:12:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:40,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:40,685 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:12:40,685 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1592163923, now seen corresponding path program 2 times [2019-11-28 18:12:40,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:40,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110658711] [2019-11-28 18:12:40,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:40,796 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:12:40,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110658711] [2019-11-28 18:12:40,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:40,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:40,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152885751] [2019-11-28 18:12:40,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:40,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:40,798 INFO L87 Difference]: Start difference. First operand 1141 states and 2476 transitions. Second operand 7 states. [2019-11-28 18:12:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:41,084 INFO L93 Difference]: Finished difference Result 3009 states and 6404 transitions. [2019-11-28 18:12:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:41,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:12:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:41,091 INFO L225 Difference]: With dead ends: 3009 [2019-11-28 18:12:41,091 INFO L226 Difference]: Without dead ends: 2016 [2019-11-28 18:12:41,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2019-11-28 18:12:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1151. [2019-11-28 18:12:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-28 18:12:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2503 transitions. [2019-11-28 18:12:41,118 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2503 transitions. Word has length 52 [2019-11-28 18:12:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:41,118 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 2503 transitions. [2019-11-28 18:12:41,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2503 transitions. [2019-11-28 18:12:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:41,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:41,122 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:12:41,122 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 3 times [2019-11-28 18:12:41,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:41,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177831274] [2019-11-28 18:12:41,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:41,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:41,229 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:41,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35|) 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t901~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t901~0.base_35|) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35|) |v_ULTIMATE.start_main_~#t901~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t901~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_~#t901~0.base=|v_ULTIMATE.start_main_~#t901~0.base_35|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_~#t901~0.offset=|v_ULTIMATE.start_main_~#t901~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t901~0.base, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t902~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t901~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:41,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t902~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13| 1) |v_#valid_29|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t902~0.offset_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13|) |v_ULTIMATE.start_main_~#t902~0.offset_11| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t902~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t902~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ULTIMATE.start_main_~#t902~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:41,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.offset_In-643568234| P0Thread1of1ForFork0_~arg.offset_Out-643568234) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-643568234| (ite (not (and (not (= (mod ~z$w_buff1_used~0_Out-643568234 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0_Out-643568234 256))))) 1 0)) (= P0Thread1of1ForFork0_~arg.base_Out-643568234 |P0Thread1of1ForFork0_#in~arg.base_In-643568234|) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-643568234 0)) (= ~z$w_buff1_used~0_Out-643568234 ~z$w_buff0_used~0_In-643568234) (= ~z$w_buff1~0_Out-643568234 ~z$w_buff0~0_In-643568234) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-643568234| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-643568234) (= 1 ~z$w_buff0_used~0_Out-643568234) (= 1 ~z$w_buff0~0_Out-643568234)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-643568234|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-643568234, ~z$w_buff0~0=~z$w_buff0~0_In-643568234, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-643568234|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-643568234|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-643568234, ~z$w_buff0~0=~z$w_buff0~0_Out-643568234, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-643568234, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-643568234, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-643568234|, ~z$w_buff1~0=~z$w_buff1~0_Out-643568234, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-643568234, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-643568234|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-643568234} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:41,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1934492166 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1934492166| |P1Thread1of1ForFork1_#t~ite23_Out-1934492166|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1934492166 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1934492166 256))) (= 0 (mod ~z$w_buff0_used~0_In-1934492166 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1934492166 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out-1934492166| ~z$w_buff1_used~0_In-1934492166) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out-1934492166| ~z$w_buff1_used~0_In-1934492166) (= |P1Thread1of1ForFork1_#t~ite23_In-1934492166| |P1Thread1of1ForFork1_#t~ite23_Out-1934492166|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1934492166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1934492166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934492166, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1934492166|, ~weak$$choice2~0=~weak$$choice2~0_In-1934492166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1934492166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1934492166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1934492166, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1934492166|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934492166, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1934492166|, ~weak$$choice2~0=~weak$$choice2~0_In-1934492166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1934492166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:41,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:41,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:41,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In960262957 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In960262957 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out960262957| ~z$w_buff0_used~0_In960262957)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out960262957| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In960262957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In960262957} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out960262957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In960262957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In960262957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:41,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2037253249 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2037253249 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-2037253249 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2037253249 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2037253249|)) (and (= ~z$w_buff1_used~0_In-2037253249 |P0Thread1of1ForFork0_#t~ite6_Out-2037253249|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037253249, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2037253249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2037253249, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2037253249} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2037253249|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037253249, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2037253249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2037253249, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2037253249} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:41,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1150956793 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1150956793 256))) (.cse2 (= ~z$r_buff0_thd1~0_In-1150956793 ~z$r_buff0_thd1~0_Out-1150956793))) (or (and (= ~z$r_buff0_thd1~0_Out-1150956793 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150956793, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1150956793} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150956793, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1150956793|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1150956793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:41,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1546668519 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1546668519 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1546668519 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1546668519 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1546668519| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1546668519| ~z$r_buff1_thd1~0_In1546668519)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1546668519, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1546668519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1546668519, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1546668519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1546668519, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1546668519|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1546668519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1546668519, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1546668519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:41,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-235470302 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-235470302| |P1Thread1of1ForFork1_#t~ite33_Out-235470302|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-235470302 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-235470302| ~z~0_In-235470302) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-235470302| ~z$w_buff1~0_In-235470302) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-235470302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-235470302, ~z$w_buff1~0=~z$w_buff1~0_In-235470302, ~z~0=~z~0_In-235470302} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-235470302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-235470302, ~z$w_buff1~0=~z$w_buff1~0_In-235470302, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-235470302|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-235470302|, ~z~0=~z~0_In-235470302} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:41,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2061015540 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-2061015540 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2061015540|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2061015540 |P1Thread1of1ForFork1_#t~ite34_Out-2061015540|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2061015540, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2061015540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2061015540, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2061015540|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2061015540} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:41,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-374952008 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-374952008 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-374952008 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-374952008 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-374952008| ~z$w_buff1_used~0_In-374952008) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-374952008| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-374952008, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-374952008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-374952008, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-374952008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-374952008, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-374952008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-374952008, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-374952008|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-374952008} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:41,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In606920084 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In606920084 256)))) (or (and (= ~z$r_buff0_thd2~0_In606920084 |P1Thread1of1ForFork1_#t~ite36_Out606920084|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out606920084| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In606920084, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In606920084} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In606920084, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In606920084, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out606920084|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:41,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1731994960 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1731994960 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1731994960 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1731994960 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1731994960| ~z$r_buff1_thd2~0_In1731994960)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out1731994960| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1731994960, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1731994960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1731994960, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1731994960} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1731994960, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1731994960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1731994960, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1731994960, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1731994960|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:41,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:41,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:41,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:41,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1601863110 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1601863110 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1601863110| ~z~0_In-1601863110)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1601863110| ~z$w_buff1~0_In-1601863110) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1601863110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601863110, ~z$w_buff1~0=~z$w_buff1~0_In-1601863110, ~z~0=~z~0_In-1601863110} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1601863110|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1601863110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601863110, ~z$w_buff1~0=~z$w_buff1~0_In-1601863110, ~z~0=~z~0_In-1601863110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:41,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:41,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-640382425 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-640382425 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-640382425 |ULTIMATE.start_main_#t~ite42_Out-640382425|)) (and (= |ULTIMATE.start_main_#t~ite42_Out-640382425| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-640382425, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-640382425} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-640382425, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-640382425, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-640382425|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:41,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In265970412 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In265970412 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In265970412 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In265970412 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out265970412|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In265970412 |ULTIMATE.start_main_#t~ite43_Out265970412|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In265970412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In265970412, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In265970412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265970412} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In265970412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In265970412, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In265970412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265970412, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out265970412|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:41,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2066213050 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2066213050 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2066213050| ~z$r_buff0_thd0~0_In-2066213050)) (and (= |ULTIMATE.start_main_#t~ite44_Out-2066213050| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2066213050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2066213050} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2066213050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2066213050, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2066213050|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:41,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1662529214 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1662529214 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1662529214 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1662529214 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1662529214| ~z$r_buff1_thd0~0_In-1662529214)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1662529214| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1662529214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662529214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1662529214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662529214} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1662529214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662529214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1662529214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662529214, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1662529214|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:41,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:41,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:41 BasicIcfg [2019-11-28 18:12:41,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:41,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:41,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:41,314 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:41,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:26" (3/4) ... [2019-11-28 18:12:41,318 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:41,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35|) 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t901~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t901~0.base_35|) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35|) |v_ULTIMATE.start_main_~#t901~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t901~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_~#t901~0.base=|v_ULTIMATE.start_main_~#t901~0.base_35|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_~#t901~0.offset=|v_ULTIMATE.start_main_~#t901~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t901~0.base, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t902~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t901~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:41,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t902~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13| 1) |v_#valid_29|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t902~0.offset_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13|) |v_ULTIMATE.start_main_~#t902~0.offset_11| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t902~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t902~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ULTIMATE.start_main_~#t902~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:41,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.offset_In-643568234| P0Thread1of1ForFork0_~arg.offset_Out-643568234) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-643568234| (ite (not (and (not (= (mod ~z$w_buff1_used~0_Out-643568234 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0_Out-643568234 256))))) 1 0)) (= P0Thread1of1ForFork0_~arg.base_Out-643568234 |P0Thread1of1ForFork0_#in~arg.base_In-643568234|) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-643568234 0)) (= ~z$w_buff1_used~0_Out-643568234 ~z$w_buff0_used~0_In-643568234) (= ~z$w_buff1~0_Out-643568234 ~z$w_buff0~0_In-643568234) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-643568234| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-643568234) (= 1 ~z$w_buff0_used~0_Out-643568234) (= 1 ~z$w_buff0~0_Out-643568234)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-643568234|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-643568234, ~z$w_buff0~0=~z$w_buff0~0_In-643568234, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-643568234|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-643568234|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-643568234, ~z$w_buff0~0=~z$w_buff0~0_Out-643568234, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-643568234, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-643568234, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-643568234|, ~z$w_buff1~0=~z$w_buff1~0_Out-643568234, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-643568234, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-643568234|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-643568234} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:41,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1934492166 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1934492166| |P1Thread1of1ForFork1_#t~ite23_Out-1934492166|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1934492166 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1934492166 256))) (= 0 (mod ~z$w_buff0_used~0_In-1934492166 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1934492166 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out-1934492166| ~z$w_buff1_used~0_In-1934492166) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out-1934492166| ~z$w_buff1_used~0_In-1934492166) (= |P1Thread1of1ForFork1_#t~ite23_In-1934492166| |P1Thread1of1ForFork1_#t~ite23_Out-1934492166|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1934492166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1934492166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934492166, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1934492166|, ~weak$$choice2~0=~weak$$choice2~0_In-1934492166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1934492166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1934492166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1934492166, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1934492166|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934492166, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1934492166|, ~weak$$choice2~0=~weak$$choice2~0_In-1934492166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1934492166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:41,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:41,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:41,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In960262957 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In960262957 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out960262957| ~z$w_buff0_used~0_In960262957)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out960262957| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In960262957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In960262957} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out960262957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In960262957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In960262957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:41,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2037253249 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2037253249 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-2037253249 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2037253249 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2037253249|)) (and (= ~z$w_buff1_used~0_In-2037253249 |P0Thread1of1ForFork0_#t~ite6_Out-2037253249|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037253249, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2037253249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2037253249, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2037253249} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2037253249|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037253249, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2037253249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2037253249, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2037253249} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:41,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1150956793 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1150956793 256))) (.cse2 (= ~z$r_buff0_thd1~0_In-1150956793 ~z$r_buff0_thd1~0_Out-1150956793))) (or (and (= ~z$r_buff0_thd1~0_Out-1150956793 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150956793, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1150956793} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150956793, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1150956793|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1150956793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:41,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1546668519 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1546668519 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1546668519 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1546668519 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1546668519| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1546668519| ~z$r_buff1_thd1~0_In1546668519)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1546668519, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1546668519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1546668519, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1546668519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1546668519, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1546668519|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1546668519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1546668519, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1546668519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:41,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-235470302 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-235470302| |P1Thread1of1ForFork1_#t~ite33_Out-235470302|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-235470302 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-235470302| ~z~0_In-235470302) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-235470302| ~z$w_buff1~0_In-235470302) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-235470302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-235470302, ~z$w_buff1~0=~z$w_buff1~0_In-235470302, ~z~0=~z~0_In-235470302} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-235470302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-235470302, ~z$w_buff1~0=~z$w_buff1~0_In-235470302, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-235470302|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-235470302|, ~z~0=~z~0_In-235470302} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:41,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2061015540 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-2061015540 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2061015540|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2061015540 |P1Thread1of1ForFork1_#t~ite34_Out-2061015540|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2061015540, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2061015540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2061015540, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2061015540|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2061015540} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:41,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-374952008 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-374952008 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-374952008 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-374952008 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-374952008| ~z$w_buff1_used~0_In-374952008) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-374952008| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-374952008, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-374952008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-374952008, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-374952008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-374952008, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-374952008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-374952008, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-374952008|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-374952008} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:41,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In606920084 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In606920084 256)))) (or (and (= ~z$r_buff0_thd2~0_In606920084 |P1Thread1of1ForFork1_#t~ite36_Out606920084|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out606920084| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In606920084, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In606920084} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In606920084, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In606920084, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out606920084|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:41,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1731994960 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1731994960 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1731994960 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1731994960 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1731994960| ~z$r_buff1_thd2~0_In1731994960)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out1731994960| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1731994960, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1731994960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1731994960, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1731994960} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1731994960, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1731994960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1731994960, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1731994960, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1731994960|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:41,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:41,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:41,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:41,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1601863110 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1601863110 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1601863110| ~z~0_In-1601863110)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1601863110| ~z$w_buff1~0_In-1601863110) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1601863110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601863110, ~z$w_buff1~0=~z$w_buff1~0_In-1601863110, ~z~0=~z~0_In-1601863110} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1601863110|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1601863110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601863110, ~z$w_buff1~0=~z$w_buff1~0_In-1601863110, ~z~0=~z~0_In-1601863110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:41,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:41,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-640382425 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-640382425 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-640382425 |ULTIMATE.start_main_#t~ite42_Out-640382425|)) (and (= |ULTIMATE.start_main_#t~ite42_Out-640382425| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-640382425, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-640382425} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-640382425, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-640382425, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-640382425|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:41,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In265970412 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In265970412 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In265970412 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In265970412 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out265970412|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In265970412 |ULTIMATE.start_main_#t~ite43_Out265970412|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In265970412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In265970412, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In265970412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265970412} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In265970412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In265970412, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In265970412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265970412, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out265970412|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2066213050 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2066213050 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2066213050| ~z$r_buff0_thd0~0_In-2066213050)) (and (= |ULTIMATE.start_main_#t~ite44_Out-2066213050| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2066213050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2066213050} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2066213050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2066213050, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2066213050|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1662529214 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1662529214 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1662529214 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1662529214 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1662529214| ~z$r_buff1_thd0~0_In-1662529214)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1662529214| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1662529214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662529214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1662529214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662529214} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1662529214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1662529214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1662529214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1662529214, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1662529214|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:41,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:41,463 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:41,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:41,465 INFO L168 Benchmark]: Toolchain (without parser) took 16638.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.2 MB). Free memory was 956.3 MB in the beginning and 849.9 MB in the end (delta: 106.5 MB). Peak memory consumption was 532.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,466 INFO L168 Benchmark]: CDTParser took 0.25 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:12:41,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,467 INFO L168 Benchmark]: Boogie Preprocessor took 81.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:41,468 INFO L168 Benchmark]: RCFGBuilder took 819.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,468 INFO L168 Benchmark]: TraceAbstraction took 14713.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.4 MB). Free memory was 1.0 GB in the beginning and 861.8 MB in the end (delta: 179.6 MB). Peak memory consumption was 480.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,469 INFO L168 Benchmark]: Witness Printer took 149.24 ms. Allocated memory is still 1.5 GB. Free memory was 861.8 MB in the beginning and 849.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,471 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.25 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 803.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 819.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14713.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.4 MB). Free memory was 1.0 GB in the beginning and 861.8 MB in the end (delta: 179.6 MB). Peak memory consumption was 480.0 MB. Max. memory is 11.5 GB. * Witness Printer took 149.24 ms. Allocated memory is still 1.5 GB. Free memory was 861.8 MB in the beginning and 849.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2020 SDtfs, 1733 SDslu, 4438 SDs, 0 SdLazy, 2707 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 28 SyntacticMatches, 16 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 4094 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 109446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...