./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/podwr000_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/podwr000_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 d1dedba2f53a8b300af4003ab021582d8cfaa8de ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:20:40,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:20:40,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:20:40,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:20:40,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:20:40,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:20:40,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:20:40,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:20:40,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:20:40,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:20:40,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:20:40,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:20:40,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:20:40,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:20:40,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:20:40,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:20:40,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:20:40,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:20:40,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:20:40,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:20:40,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:20:40,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:20:40,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:20:40,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:20:40,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:20:40,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:20:40,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:20:40,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:20:40,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:20:40,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:20:40,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:20:40,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:20:40,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:20:40,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:20:40,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:20:40,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:20:40,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:20:40,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:20:40,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:20:40,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:20:40,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:20:40,751 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:20:40,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:20:40,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:20:40,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:20:40,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:20:40,770 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:20:40,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:20:40,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:20:40,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:20:40,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:20:40,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:20:40,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:20:40,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:20:40,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:20:40,773 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:20:40,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:20:40,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:20:40,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:20:40,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:20:40,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:20:40,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:20:40,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:20:40,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:20:40,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:20:40,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:20:40,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:20:40,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:20:40,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:20:40,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:20:40,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:20:40,778 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 -> d1dedba2f53a8b300af4003ab021582d8cfaa8de [2019-11-28 18:20:41,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:20:41,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:20:41,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:20:41,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:20:41,217 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:20:41,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/podwr000_pso.oepc.i [2019-11-28 18:20:41,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc784828/0f7b07308d2c440bac1ad59247cfebd2/FLAGbfa5523e3 [2019-11-28 18:20:41,855 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:20:41,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/podwr000_pso.oepc.i [2019-11-28 18:20:41,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc784828/0f7b07308d2c440bac1ad59247cfebd2/FLAGbfa5523e3 [2019-11-28 18:20:42,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc784828/0f7b07308d2c440bac1ad59247cfebd2 [2019-11-28 18:20:42,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:20:42,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:20:42,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:20:42,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:20:42,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:20:42,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:42" (1/1) ... [2019-11-28 18:20:42,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3272ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42, skipping insertion in model container [2019-11-28 18:20:42,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:42" (1/1) ... [2019-11-28 18:20:42,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:20:42,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:20:42,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:20:42,879 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:20:42,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:20:43,027 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:20:43,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43 WrapperNode [2019-11-28 18:20:43,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:20:43,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:20:43,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:20:43,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:20:43,037 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:20:43" (1/1) ... [2019-11-28 18:20:43,066 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:20:43" (1/1) ... [2019-11-28 18:20:43,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:20:43,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:20:43,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:20:43,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:20:43,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (1/1) ... [2019-11-28 18:20:43,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:20:43,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:20:43,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:20:43,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:20:43,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (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:20:43,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:20:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:20:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:20:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:20:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:20:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:20:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:20:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:20:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:20:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:20:43,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:20:43,285 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:20:44,116 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:20:44,117 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:20:44,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:44 BoogieIcfgContainer [2019-11-28 18:20:44,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:20:44,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:20:44,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:20:44,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:20:44,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:42" (1/3) ... [2019-11-28 18:20:44,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e79e43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:44, skipping insertion in model container [2019-11-28 18:20:44,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:43" (2/3) ... [2019-11-28 18:20:44,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e79e43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:44, skipping insertion in model container [2019-11-28 18:20:44,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:44" (3/3) ... [2019-11-28 18:20:44,130 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_pso.oepc.i [2019-11-28 18:20:44,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:20:44,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:20:44,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:20:44,149 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:20:44,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:44,250 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:20:44,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:20:44,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:20:44,268 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:20:44,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:20:44,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:20:44,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:20:44,269 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:20:44,269 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:20:44,287 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:20:44,289 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:20:44,372 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:20:44,372 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:20:44,389 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:20:44,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:20:44,495 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:20:44,496 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:20:44,505 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:20:44,526 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:20:44,528 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:20:49,112 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:20:49,270 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:20:49,349 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:20:49,350 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:20:49,353 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:20:49,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:20:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:20:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:20:49,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:49,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:20:49,899 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:20:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:20:49,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:49,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558066767] [2019-11-28 18:20:49,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:50,279 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:20:50,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558066767] [2019-11-28 18:20:50,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:50,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:20:50,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836581915] [2019-11-28 18:20:50,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:20:50,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:20:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:20:50,318 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:20:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:50,596 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:20:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:20:50,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:20:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:50,676 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:20:50,677 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:20:50,678 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:20:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:20:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:20:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:20:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:20:51,095 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:20:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:51,096 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:20:51,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:20:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:20:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:20:51,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:51,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:20:51,101 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:20:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:51,101 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:20:51,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:51,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469328741] [2019-11-28 18:20:51,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:51,190 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:20:51,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469328741] [2019-11-28 18:20:51,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:51,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:20:51,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245730436] [2019-11-28 18:20:51,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:20:51,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:20:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:20:51,194 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:20:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:51,590 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-11-28 18:20:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:20:51,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:20:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:51,670 INFO L225 Difference]: With dead ends: 11630 [2019-11-28 18:20:51,670 INFO L226 Difference]: Without dead ends: 11623 [2019-11-28 18:20:51,672 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:20:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-11-28 18:20:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-11-28 18:20:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-11-28 18:20:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-11-28 18:20:52,298 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-11-28 18:20:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:52,298 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-11-28 18:20:52,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:20:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-11-28 18:20:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:20:52,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:52,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:20:52,310 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:20:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:20:52,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:52,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416700568] [2019-11-28 18:20:52,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:52,466 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:20:52,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416700568] [2019-11-28 18:20:52,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:52,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:20:52,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101041816] [2019-11-28 18:20:52,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:20:52,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:20:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:20:52,470 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-11-28 18:20:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:52,849 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-11-28 18:20:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:20:52,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:20:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:52,903 INFO L225 Difference]: With dead ends: 14471 [2019-11-28 18:20:52,903 INFO L226 Difference]: Without dead ends: 14471 [2019-11-28 18:20:52,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:20:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-11-28 18:20:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-11-28 18:20:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-11-28 18:20:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-11-28 18:20:53,324 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-11-28 18:20:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:53,325 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-11-28 18:20:53,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:20:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-11-28 18:20:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:20:53,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:53,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:20:53,331 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:20:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-11-28 18:20:53,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:53,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429633470] [2019-11-28 18:20:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:53,455 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:20:53,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429633470] [2019-11-28 18:20:53,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:53,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:20:53,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240508431] [2019-11-28 18:20:53,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:20:53,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:20:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:20:53,457 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-11-28 18:20:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:53,565 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-11-28 18:20:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:20:53,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:20:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:53,614 INFO L225 Difference]: With dead ends: 10750 [2019-11-28 18:20:53,615 INFO L226 Difference]: Without dead ends: 10750 [2019-11-28 18:20:53,615 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:20:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-11-28 18:20:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-11-28 18:20:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-11-28 18:20:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-11-28 18:20:53,917 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-11-28 18:20:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:53,917 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-11-28 18:20:53,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:20:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-11-28 18:20:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:20:53,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:53,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:20:53,922 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:20:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-11-28 18:20:53,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:53,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286575237] [2019-11-28 18:20:53,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:53,992 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:20:53,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286575237] [2019-11-28 18:20:53,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:53,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:20:53,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949576986] [2019-11-28 18:20:53,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:20:53,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:53,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:20:53,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:20:53,994 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-11-28 18:20:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:54,032 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-11-28 18:20:54,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:20:54,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:20:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:54,039 INFO L225 Difference]: With dead ends: 2054 [2019-11-28 18:20:54,040 INFO L226 Difference]: Without dead ends: 1457 [2019-11-28 18:20:54,041 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:20:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-11-28 18:20:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-11-28 18:20:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-11-28 18:20:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-11-28 18:20:54,073 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-11-28 18:20:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:54,073 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-11-28 18:20:54,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:20:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-11-28 18:20:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:20:54,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:54,079 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:20:54,079 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:20:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:20:54,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:54,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137910813] [2019-11-28 18:20:54,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:20:54,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137910813] [2019-11-28 18:20:54,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:54,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:20:54,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480938321] [2019-11-28 18:20:54,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:20:54,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:20:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:20:54,243 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-11-28 18:20:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:54,747 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-11-28 18:20:54,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:20:54,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:20:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:54,757 INFO L225 Difference]: With dead ends: 2249 [2019-11-28 18:20:54,757 INFO L226 Difference]: Without dead ends: 2197 [2019-11-28 18:20:54,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:20:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-11-28 18:20:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-11-28 18:20:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-28 18:20:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-11-28 18:20:54,790 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-11-28 18:20:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:54,791 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-11-28 18:20:54,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:20:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-11-28 18:20:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:20:54,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:54,796 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:20:54,797 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:20:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-11-28 18:20:54,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:54,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518753917] [2019-11-28 18:20:54,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:20:54,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518753917] [2019-11-28 18:20:54,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:54,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:20:54,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840867680] [2019-11-28 18:20:54,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:20:54,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:54,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:20:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:20:54,910 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-11-28 18:20:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:54,953 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-11-28 18:20:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:20:54,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:20:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:54,955 INFO L225 Difference]: With dead ends: 752 [2019-11-28 18:20:54,955 INFO L226 Difference]: Without dead ends: 689 [2019-11-28 18:20:54,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:20:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-28 18:20:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-28 18:20:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-28 18:20:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-11-28 18:20:54,967 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-11-28 18:20:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:54,968 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-11-28 18:20:54,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:20:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-11-28 18:20:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:20:54,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:54,971 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:20:54,972 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:20:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-11-28 18:20:54,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:54,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171419564] [2019-11-28 18:20:54,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:55,089 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:20:55,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171419564] [2019-11-28 18:20:55,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:55,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:20:55,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174527119] [2019-11-28 18:20:55,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:20:55,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:20:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:20:55,091 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-11-28 18:20:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:55,480 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-11-28 18:20:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:20:55,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 18:20:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:55,485 INFO L225 Difference]: With dead ends: 1105 [2019-11-28 18:20:55,486 INFO L226 Difference]: Without dead ends: 1105 [2019-11-28 18:20:55,487 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:20:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-11-28 18:20:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-11-28 18:20:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-28 18:20:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-11-28 18:20:55,505 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-11-28 18:20:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:55,508 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-11-28 18:20:55,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:20:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-11-28 18:20:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:20:55,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:55,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, 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:20:55,512 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:20:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:55,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-11-28 18:20:55,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:55,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803170362] [2019-11-28 18:20:55,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:55,600 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:20:55,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803170362] [2019-11-28 18:20:55,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:55,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:20:55,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008124647] [2019-11-28 18:20:55,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:20:55,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:55,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:20:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:20:55,603 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-11-28 18:20:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:55,673 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-11-28 18:20:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:20:55,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:20:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:55,677 INFO L225 Difference]: With dead ends: 1184 [2019-11-28 18:20:55,677 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:20:55,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:20:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:20:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-11-28 18:20:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:20:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-11-28 18:20:55,699 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-11-28 18:20:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:55,699 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-11-28 18:20:55,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:20:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-11-28 18:20:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:20:55,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:55,703 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:20:55,703 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:20:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:20:55,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:55,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192130264] [2019-11-28 18:20:55,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:55,822 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:20:55,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192130264] [2019-11-28 18:20:55,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:55,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:20:55,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466016865] [2019-11-28 18:20:55,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:20:55,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:20:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:20:55,825 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 4 states. [2019-11-28 18:20:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:55,844 INFO L93 Difference]: Finished difference Result 1646 states and 3628 transitions. [2019-11-28 18:20:55,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:20:55,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:20:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:55,847 INFO L225 Difference]: With dead ends: 1646 [2019-11-28 18:20:55,847 INFO L226 Difference]: Without dead ends: 759 [2019-11-28 18:20:55,848 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:20:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-28 18:20:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-11-28 18:20:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-28 18:20:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-11-28 18:20:55,861 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-11-28 18:20:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:55,862 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-11-28 18:20:55,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:20:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-11-28 18:20:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:20:55,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:55,865 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:20:55,865 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:20:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-11-28 18:20:55,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:55,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330782063] [2019-11-28 18:20:55,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:56,259 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:20:56,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330782063] [2019-11-28 18:20:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:56,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:20:56,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344716792] [2019-11-28 18:20:56,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:20:56,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:20:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:20:56,262 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-11-28 18:20:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:57,460 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-11-28 18:20:57,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 18:20:57,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:20:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:57,464 INFO L225 Difference]: With dead ends: 1086 [2019-11-28 18:20:57,464 INFO L226 Difference]: Without dead ends: 865 [2019-11-28 18:20:57,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-28 18:20:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-28 18:20:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-11-28 18:20:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 18:20:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-11-28 18:20:57,479 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-11-28 18:20:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:57,480 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-11-28 18:20:57,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:20:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-11-28 18:20:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:20:57,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:57,483 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:20:57,483 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:20:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-11-28 18:20:57,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:57,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531316790] [2019-11-28 18:20:57,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:57,601 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:20:57,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531316790] [2019-11-28 18:20:57,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:57,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:20:57,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917617134] [2019-11-28 18:20:57,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:20:57,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:20:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:20:57,604 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 7 states. [2019-11-28 18:20:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:20:57,791 INFO L93 Difference]: Finished difference Result 1290 states and 2749 transitions. [2019-11-28 18:20:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:20:57,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:20:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:20:57,794 INFO L225 Difference]: With dead ends: 1290 [2019-11-28 18:20:57,794 INFO L226 Difference]: Without dead ends: 919 [2019-11-28 18:20:57,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:20:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-11-28 18:20:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-11-28 18:20:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-28 18:20:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-11-28 18:20:57,811 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-11-28 18:20:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:20:57,811 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-11-28 18:20:57,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:20:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-11-28 18:20:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:20:57,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:57,815 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:20:57,815 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:20:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 4 times [2019-11-28 18:20:57,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:57,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059032119] [2019-11-28 18:20:57,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:20:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:20:58,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:20:58,010 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:20:58,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40|) |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1549~0.base_40|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40|)) (= v_~y~0_133 0) (= |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| 4) |v_#length_17|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_27|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1549~0.offset=|v_ULTIMATE.start_main_~#t1549~0.offset_27|, ULTIMATE.start_main_~#t1549~0.base=|v_ULTIMATE.start_main_~#t1549~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1550~0.offset, ULTIMATE.start_main_~#t1550~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1549~0.offset, ULTIMATE.start_main_~#t1549~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:20:58,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1550~0.base_13| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13|) |v_ULTIMATE.start_main_~#t1550~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1550~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1550~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1550~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1550~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:20:58,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~x~0_In-707544651 ~__unbuffered_p0_EAX~0_Out-707544651) (= ~y$r_buff0_thd1~0_Out-707544651 1) (= ~y$r_buff1_thd0~0_Out-707544651 ~y$r_buff0_thd0~0_In-707544651) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-707544651 0)) (= ~y$r_buff1_thd2~0_Out-707544651 ~y$r_buff0_thd2~0_In-707544651) (= ~y$r_buff0_thd1~0_In-707544651 ~y$r_buff1_thd1~0_Out-707544651)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-707544651, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-707544651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-707544651, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-707544651, ~x~0=~x~0_In-707544651} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-707544651, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-707544651, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-707544651, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-707544651, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-707544651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-707544651, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-707544651, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-707544651, ~x~0=~x~0_In-707544651} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:20:58,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2135559413 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In2135559413 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2135559413| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2135559413| ~y$w_buff0_used~0_In2135559413) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135559413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135559413} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2135559413|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135559413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135559413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:20:58,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1326128776 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1326128776| |P1Thread1of1ForFork1_#t~ite20_Out-1326128776|) (not .cse0) (= ~y$w_buff0_used~0_In-1326128776 |P1Thread1of1ForFork1_#t~ite21_Out-1326128776|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1326128776| |P1Thread1of1ForFork1_#t~ite21_Out-1326128776|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1326128776 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1326128776 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1326128776 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1326128776 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1326128776| ~y$w_buff0_used~0_In-1326128776)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326128776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326128776, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1326128776|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326128776, ~weak$$choice2~0=~weak$$choice2~0_In-1326128776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326128776} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326128776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326128776, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1326128776|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326128776, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1326128776|, ~weak$$choice2~0=~weak$$choice2~0_In-1326128776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326128776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:20:58,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out900153567| |P1Thread1of1ForFork1_#t~ite23_Out900153567|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In900153567 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In900153567 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In900153567 256) 0)) (.cse5 (= (mod ~y$r_buff1_thd2~0_In900153567 256) 0)) (.cse4 (= 0 (mod ~y$r_buff0_thd2~0_In900153567 256)))) (or (and (or (and .cse0 .cse1 (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4)) (= ~y$w_buff1_used~0_In900153567 |P1Thread1of1ForFork1_#t~ite23_Out900153567|)) (and (= ~y$w_buff1_used~0_In900153567 |P1Thread1of1ForFork1_#t~ite24_Out900153567|) (= |P1Thread1of1ForFork1_#t~ite23_In900153567| |P1Thread1of1ForFork1_#t~ite23_Out900153567|) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite22_In900153567| |P1Thread1of1ForFork1_#t~ite22_Out900153567|)) (let ((.cse6 (not .cse4))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out900153567| |P1Thread1of1ForFork1_#t~ite23_Out900153567|) .cse1 (= |P1Thread1of1ForFork1_#t~ite22_Out900153567| 0) (or .cse6 (not .cse3)) (not .cse2) (or (not .cse5) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In900153567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In900153567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In900153567, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In900153567|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In900153567|, ~weak$$choice2~0=~weak$$choice2~0_In900153567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In900153567} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In900153567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In900153567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In900153567, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out900153567|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out900153567|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out900153567|, ~weak$$choice2~0=~weak$$choice2~0_In900153567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In900153567} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:20:58,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1407306795 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1407306795 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1407306795 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1407306795 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1407306795|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1407306795 |P0Thread1of1ForFork0_#t~ite6_Out1407306795|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1407306795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1407306795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1407306795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407306795} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1407306795|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1407306795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1407306795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1407306795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407306795} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:20:58,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1140135899 256))) (.cse2 (= ~y$r_buff0_thd1~0_In1140135899 ~y$r_buff0_thd1~0_Out1140135899)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1140135899 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1140135899)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1140135899, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1140135899} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1140135899, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1140135899|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1140135899} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:20:58,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-1573044159 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1573044159 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1573044159 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1573044159 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1573044159| ~y$r_buff1_thd1~0_In-1573044159) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1573044159| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1573044159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1573044159, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1573044159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1573044159} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1573044159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1573044159, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1573044159|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1573044159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1573044159} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:20:58,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:20:58,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2144004192 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2144004192 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-2144004192 256)) (and (= (mod ~y$r_buff1_thd2~0_In-2144004192 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2144004192 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2144004192| |P1Thread1of1ForFork1_#t~ite30_Out-2144004192|) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-2144004192| ~y$r_buff1_thd2~0_In-2144004192)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In-2144004192| |P1Thread1of1ForFork1_#t~ite29_Out-2144004192|) (= ~y$r_buff1_thd2~0_In-2144004192 |P1Thread1of1ForFork1_#t~ite30_Out-2144004192|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2144004192, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2144004192|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144004192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144004192, ~weak$$choice2~0=~weak$$choice2~0_In-2144004192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2144004192} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2144004192, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2144004192|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2144004192|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144004192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144004192, ~weak$$choice2~0=~weak$$choice2~0_In-2144004192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2144004192} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:20:58,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:20:58,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1062604738 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1062604738 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1062604738| ~y~0_In-1062604738)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1062604738| ~y$w_buff1~0_In-1062604738)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1062604738, ~y$w_buff1~0=~y$w_buff1~0_In-1062604738, ~y~0=~y~0_In-1062604738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062604738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1062604738, ~y$w_buff1~0=~y$w_buff1~0_In-1062604738, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1062604738|, ~y~0=~y~0_In-1062604738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062604738} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:20:58,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:20:58,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1996518163 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1996518163 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1996518163|)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1996518163| ~y$w_buff0_used~0_In1996518163) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1996518163, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1996518163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1996518163, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1996518163, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1996518163|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:20:58,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In125663005 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In125663005 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In125663005 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In125663005 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out125663005| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out125663005| ~y$w_buff1_used~0_In125663005) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In125663005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In125663005, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In125663005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In125663005} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In125663005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In125663005, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In125663005, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out125663005|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In125663005} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:20:58,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2014387638 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2014387638 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In2014387638 |P1Thread1of1ForFork1_#t~ite36_Out2014387638|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out2014387638| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2014387638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2014387638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2014387638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2014387638, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2014387638|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:20:58,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1271674460 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1271674460 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1271674460 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1271674460 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1271674460 |P1Thread1of1ForFork1_#t~ite37_Out1271674460|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1271674460|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1271674460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1271674460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1271674460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1271674460} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1271674460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1271674460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1271674460, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1271674460|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1271674460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:20:58,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:20:58,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:20:58,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:20:58,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In473954532 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In473954532 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out473954532| ~y~0_In473954532)) (and (= |ULTIMATE.start_main_#t~ite40_Out473954532| ~y$w_buff1~0_In473954532) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In473954532, ~y~0=~y~0_In473954532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In473954532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In473954532} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out473954532|, ~y$w_buff1~0=~y$w_buff1~0_In473954532, ~y~0=~y~0_In473954532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In473954532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In473954532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:20:58,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:20:58,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-501206305 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-501206305 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-501206305| ~y$w_buff0_used~0_In-501206305) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-501206305| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-501206305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-501206305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-501206305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-501206305, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-501206305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:20:58,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1958062573 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1958062573 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1958062573 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1958062573 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1958062573| ~y$w_buff1_used~0_In1958062573) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out1958062573| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1958062573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1958062573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1958062573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1958062573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1958062573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1958062573, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1958062573|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1958062573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1958062573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:20:58,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-166381669 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-166381669 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-166381669 |ULTIMATE.start_main_#t~ite44_Out-166381669|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-166381669|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-166381669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-166381669} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-166381669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-166381669, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-166381669|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:20:58,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1073241087 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1073241087 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1073241087 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1073241087 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1073241087| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1073241087| ~y$r_buff1_thd0~0_In-1073241087)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073241087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1073241087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1073241087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073241087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073241087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1073241087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1073241087, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1073241087|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073241087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:20:58,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:20:58,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:20:58 BasicIcfg [2019-11-28 18:20:58,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:20:58,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:20:58,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:20:58,118 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:20:58,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:44" (3/4) ... [2019-11-28 18:20:58,122 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:20:58,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40|) |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1549~0.base_40|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40|)) (= v_~y~0_133 0) (= |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| 4) |v_#length_17|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_27|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1549~0.offset=|v_ULTIMATE.start_main_~#t1549~0.offset_27|, ULTIMATE.start_main_~#t1549~0.base=|v_ULTIMATE.start_main_~#t1549~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1550~0.offset, ULTIMATE.start_main_~#t1550~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1549~0.offset, ULTIMATE.start_main_~#t1549~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:20:58,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1550~0.base_13| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13|) |v_ULTIMATE.start_main_~#t1550~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1550~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1550~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1550~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1550~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:20:58,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~x~0_In-707544651 ~__unbuffered_p0_EAX~0_Out-707544651) (= ~y$r_buff0_thd1~0_Out-707544651 1) (= ~y$r_buff1_thd0~0_Out-707544651 ~y$r_buff0_thd0~0_In-707544651) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-707544651 0)) (= ~y$r_buff1_thd2~0_Out-707544651 ~y$r_buff0_thd2~0_In-707544651) (= ~y$r_buff0_thd1~0_In-707544651 ~y$r_buff1_thd1~0_Out-707544651)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-707544651, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-707544651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-707544651, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-707544651, ~x~0=~x~0_In-707544651} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-707544651, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-707544651, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-707544651, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-707544651, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-707544651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-707544651, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-707544651, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-707544651, ~x~0=~x~0_In-707544651} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:20:58,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2135559413 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In2135559413 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2135559413| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2135559413| ~y$w_buff0_used~0_In2135559413) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135559413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135559413} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2135559413|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135559413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135559413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:20:58,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1326128776 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1326128776| |P1Thread1of1ForFork1_#t~ite20_Out-1326128776|) (not .cse0) (= ~y$w_buff0_used~0_In-1326128776 |P1Thread1of1ForFork1_#t~ite21_Out-1326128776|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1326128776| |P1Thread1of1ForFork1_#t~ite21_Out-1326128776|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1326128776 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1326128776 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1326128776 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1326128776 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1326128776| ~y$w_buff0_used~0_In-1326128776)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326128776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326128776, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1326128776|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326128776, ~weak$$choice2~0=~weak$$choice2~0_In-1326128776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326128776} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326128776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326128776, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1326128776|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326128776, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1326128776|, ~weak$$choice2~0=~weak$$choice2~0_In-1326128776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326128776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:20:58,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out900153567| |P1Thread1of1ForFork1_#t~ite23_Out900153567|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In900153567 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In900153567 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In900153567 256) 0)) (.cse5 (= (mod ~y$r_buff1_thd2~0_In900153567 256) 0)) (.cse4 (= 0 (mod ~y$r_buff0_thd2~0_In900153567 256)))) (or (and (or (and .cse0 .cse1 (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4)) (= ~y$w_buff1_used~0_In900153567 |P1Thread1of1ForFork1_#t~ite23_Out900153567|)) (and (= ~y$w_buff1_used~0_In900153567 |P1Thread1of1ForFork1_#t~ite24_Out900153567|) (= |P1Thread1of1ForFork1_#t~ite23_In900153567| |P1Thread1of1ForFork1_#t~ite23_Out900153567|) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite22_In900153567| |P1Thread1of1ForFork1_#t~ite22_Out900153567|)) (let ((.cse6 (not .cse4))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out900153567| |P1Thread1of1ForFork1_#t~ite23_Out900153567|) .cse1 (= |P1Thread1of1ForFork1_#t~ite22_Out900153567| 0) (or .cse6 (not .cse3)) (not .cse2) (or (not .cse5) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In900153567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In900153567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In900153567, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In900153567|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In900153567|, ~weak$$choice2~0=~weak$$choice2~0_In900153567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In900153567} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In900153567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In900153567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In900153567, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out900153567|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out900153567|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out900153567|, ~weak$$choice2~0=~weak$$choice2~0_In900153567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In900153567} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:20:58,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1407306795 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1407306795 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1407306795 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1407306795 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1407306795|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1407306795 |P0Thread1of1ForFork0_#t~ite6_Out1407306795|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1407306795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1407306795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1407306795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407306795} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1407306795|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1407306795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1407306795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1407306795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407306795} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:20:58,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1140135899 256))) (.cse2 (= ~y$r_buff0_thd1~0_In1140135899 ~y$r_buff0_thd1~0_Out1140135899)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1140135899 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1140135899)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1140135899, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1140135899} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1140135899, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1140135899|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1140135899} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:20:58,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-1573044159 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1573044159 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1573044159 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1573044159 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1573044159| ~y$r_buff1_thd1~0_In-1573044159) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1573044159| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1573044159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1573044159, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1573044159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1573044159} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1573044159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1573044159, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1573044159|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1573044159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1573044159} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:20:58,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:20:58,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2144004192 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2144004192 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-2144004192 256)) (and (= (mod ~y$r_buff1_thd2~0_In-2144004192 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2144004192 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2144004192| |P1Thread1of1ForFork1_#t~ite30_Out-2144004192|) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-2144004192| ~y$r_buff1_thd2~0_In-2144004192)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In-2144004192| |P1Thread1of1ForFork1_#t~ite29_Out-2144004192|) (= ~y$r_buff1_thd2~0_In-2144004192 |P1Thread1of1ForFork1_#t~ite30_Out-2144004192|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2144004192, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2144004192|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144004192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144004192, ~weak$$choice2~0=~weak$$choice2~0_In-2144004192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2144004192} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2144004192, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2144004192|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2144004192|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144004192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144004192, ~weak$$choice2~0=~weak$$choice2~0_In-2144004192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2144004192} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:20:58,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:20:58,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1062604738 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1062604738 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1062604738| ~y~0_In-1062604738)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1062604738| ~y$w_buff1~0_In-1062604738)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1062604738, ~y$w_buff1~0=~y$w_buff1~0_In-1062604738, ~y~0=~y~0_In-1062604738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062604738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1062604738, ~y$w_buff1~0=~y$w_buff1~0_In-1062604738, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1062604738|, ~y~0=~y~0_In-1062604738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062604738} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:20:58,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:20:58,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1996518163 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1996518163 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1996518163|)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1996518163| ~y$w_buff0_used~0_In1996518163) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1996518163, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1996518163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1996518163, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1996518163, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1996518163|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:20:58,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In125663005 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In125663005 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In125663005 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In125663005 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out125663005| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out125663005| ~y$w_buff1_used~0_In125663005) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In125663005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In125663005, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In125663005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In125663005} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In125663005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In125663005, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In125663005, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out125663005|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In125663005} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:20:58,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2014387638 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2014387638 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In2014387638 |P1Thread1of1ForFork1_#t~ite36_Out2014387638|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out2014387638| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2014387638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2014387638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2014387638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2014387638, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2014387638|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:20:58,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1271674460 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1271674460 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1271674460 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1271674460 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1271674460 |P1Thread1of1ForFork1_#t~ite37_Out1271674460|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1271674460|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1271674460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1271674460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1271674460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1271674460} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1271674460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1271674460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1271674460, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1271674460|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1271674460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:20:58,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:20:58,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:20:58,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:20:58,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In473954532 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In473954532 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out473954532| ~y~0_In473954532)) (and (= |ULTIMATE.start_main_#t~ite40_Out473954532| ~y$w_buff1~0_In473954532) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In473954532, ~y~0=~y~0_In473954532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In473954532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In473954532} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out473954532|, ~y$w_buff1~0=~y$w_buff1~0_In473954532, ~y~0=~y~0_In473954532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In473954532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In473954532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:20:58,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:20:58,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-501206305 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-501206305 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-501206305| ~y$w_buff0_used~0_In-501206305) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-501206305| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-501206305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-501206305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-501206305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-501206305, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-501206305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:20:58,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1958062573 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1958062573 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1958062573 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1958062573 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1958062573| ~y$w_buff1_used~0_In1958062573) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out1958062573| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1958062573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1958062573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1958062573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1958062573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1958062573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1958062573, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1958062573|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1958062573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1958062573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:20:58,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-166381669 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-166381669 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-166381669 |ULTIMATE.start_main_#t~ite44_Out-166381669|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-166381669|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-166381669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-166381669} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-166381669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-166381669, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-166381669|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:20:58,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1073241087 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1073241087 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1073241087 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1073241087 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1073241087| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1073241087| ~y$r_buff1_thd0~0_In-1073241087)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073241087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1073241087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1073241087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073241087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073241087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1073241087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1073241087, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1073241087|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073241087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:20:58,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:20:58,218 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:20:58,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:20:58,220 INFO L168 Benchmark]: Toolchain (without parser) took 16044.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.7 MB). Free memory was 956.3 MB in the beginning and 870.8 MB in the end (delta: 85.5 MB). Peak memory consumption was 575.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:20:58,221 INFO L168 Benchmark]: CDTParser took 0.88 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:20:58,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:20:58,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:20:58,222 INFO L168 Benchmark]: Boogie Preprocessor took 70.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:20:58,223 INFO L168 Benchmark]: RCFGBuilder took 931.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:20:58,223 INFO L168 Benchmark]: TraceAbstraction took 13996.87 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 389.0 MB). Free memory was 1.0 GB in the beginning and 883.7 MB in the end (delta: 122.8 MB). Peak memory consumption was 511.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:20:58,224 INFO L168 Benchmark]: Witness Printer took 101.19 ms. Allocated memory is still 1.5 GB. Free memory was 883.7 MB in the beginning and 870.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:20:58,227 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.88 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 851.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 931.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13996.87 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 389.0 MB). Free memory was 1.0 GB in the beginning and 883.7 MB in the end (delta: 122.8 MB). Peak memory consumption was 511.8 MB. Max. memory is 11.5 GB. * Witness Printer took 101.19 ms. Allocated memory is still 1.5 GB. Free memory was 883.7 MB in the beginning and 870.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1402 SDtfs, 1709 SDslu, 2928 SDs, 0 SdLazy, 2108 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 5845 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 64065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...